We consider a problem of drawing a tree on parallel lines. In this problem we are given a tree and an infinite number of parallel lines in the plane. The object is to draw the tree so that (i) each vertex is placed on one of the given parallel lines, (ii) no two edges intersect, and (iii) the 'heigh
โฆ LIBER โฆ
More on systolic line drawing
โ Scribed by G.M Megson; D.J Evans
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 253 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Drawing a tree on parallel lines
โ
R. Hirabayashi; Y.T. Ikebe; K. Iwamura; T. Nakayama
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 336 KB
More on randomized on-line algorithms fo
โ
Marek Chrobak; Elias Koutsoupias; John Noga
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 143 KB
We address the tradeo between the competitive ratio and the resources used by randomized on-line algorithms for caching. Two algorithms reported in the literature that achieve the optimal ratio H k require a lot of memory and perform extensive computation at each step. On the other hand, a very simp
Method of line drawing recognition based
โ
Akira Maeda; Koji Wakimoto; Hiroto Nagahisa
๐
Article
๐
1997
๐
John Wiley and Sons
๐
English
โ 891 KB
On bit reduction of chain coded line dra
โ
P.A Sundar Raj; Jack Koplowitz
๐
Article
๐
1986
๐
Elsevier Science
๐
English
โ 231 KB
On combinatorial structures of line draw
โ
Hiroshi Imai
๐
Article
๐
1985
๐
Elsevier Science
๐
English
โ 672 KB
The on-line computer system for determin
โ
Roy H. Swatzell; William H. Bancroft Jr.; Josiah Macy Jr.; E.E. Eddleman Jr.
๐
Article
๐
1973
๐
Elsevier Science
๐
English
โ 504 KB