Book embeddings and point-set embeddings of series-parallel digraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2528 LNCS, Issue , 2002, Pages 162-173

  Di Giacomo, Emilio ^a   Didimo, Walter ^a   Liotta, Giuseppe ^a   Wismath, Stephen K ^b  

^a UNIVERSITY OF PERUGIA   (Italy)

^b UNIVERSITY OF LETHBRIDGE   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; DRAWING (GRAPHICS); GEOMETRY; HAMILTONIANS; ALGORITHMS;

BOOK EMBEDDING; HAMILTONICITY; INPUT SERIES; PLANAR DIGRAPHS; POINT-SET EMBEDDING; SERIES-PARALLEL; SERIES-PARALLEL GRAPH; TIME ALGORITHMS; EMBEDDINGS;

EMBEDDINGS; GRAPH THEORY;

EID: 84867456322     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36151-0_16     Document Type: Conference Paper

References (17)

1. M. Alzohairi and I. Rival. Series-parallel ordered sets have pagenumber two. In S. North, editor, Graph Drawing (Proc. GD '96), volume 1190 of Lecture Notes Comput. Sci., pages 11-24. Springer-Verlag, 1996.
2. F. Bernhart and P. C. Kainen. The book thickness of a graph. J. Combin. Theory, Ser. B 27:320-331, 1979.
3. P. Bose. On embedding an outer-planar graph on a point set. In G. Di Battista, editor, Graph Drawing (Proc. GD '97), volume 1353 of Lecture Notes Comput. Sci., pages 25-36. Springer-Verlag, 1997.
4. P. Bose, M. McAllister, and J. Snoeyink. Optimal algorithms to embed trees in a point set. Journal of Graph Algorithms and Applications, 2(1):1-15, 1997.
5. F. R. K. Chung, F. T. Leighton, and A. Rosenberg. Embedding graphs in books: A layout problem with applications to VLSI design. SIAM Journal on Algebraic and Discrete Methods, 8:33-58, 1987.
6. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.
7. G. Di Battista and R. Tamassia. On-line planarity testing. SIAM Journal on Computing, 25(5):956-997, October 1996.
8. S. Even and R. E. Tarjan. Computing an st-numbering. Theoret. Comput. Sci., 2:339-344, 1976.
9. J. Ganley and L. Heath. The pagenumber of k-trees is O(k). Discrete Applied Mathematics, 109:215-221, 2001.
10. P. Gritzmann, B. Mohar, J. Pach, and R. Pollack. Embedding a planar triangulation with vertices at specified poi nts. Amer. Math. Monthly, 98(2):165-166, 1991.
11. L. S. Heath and S. V. Pemmaraju. Stack and queue layouts of posets. SIAM Journal on Discrete Mathematics, 10:599-625, 1997.
12. L. S. Heath and S. V. Pemmaraju. Stack and queue layouts of directed acyclic graphs: Part II. SIAM Journal on Computing, 28:1588-1626, 1999.
13. L. S. Heath, S. V. Pemmaraju, and A. Trenk. Stack and queue layouts of directed acyclic graphs: Part I. SIAM Journal on Computing, 28:1510-1539, 1999.
14. M. Kaufmann and R. Wiese. Embedding vertices at points: Few bends suffice for planar graphs. Journal of Graph Algorithms and Applications, 6(1):115-129, 2002.
15. R. Nowakowski and A. Parker. Ordered sets, pagenumbers and planarity. Order, 6:209-218, 1989.
16. J. Valdes, R. E. Tarjan, and E. Lawler. The recognition of series-parallel digraphs. SIAM J. Comput., 11(2):298-313, 1982.
17. M. Yannakakis. Embedding planar graphs in four pages. Journal of Computer and System Sciences, 38:36-67, 1989.