Bounded degree book embeddings and three-dimensional orthogonal graph drawing

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

Volumn 2265 LNCS, Issue , 2002, Pages 312-327

  Wood, David R ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); EMBEDDINGS; ALGORITHMS;

BOOK EMBEDDING; BOUNDED DEGREE; GRAPH G; HALF-PLANES; LAS VEGAS ALGORITHMS; LINEAR ORDER; ORTHOGONAL DRAWINGS; ORTHOGONAL GRAPHS; EMBEDDINGS;

GRAPH THEORY;

EID: 84867451565     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45848-4_25     Document Type: Conference Paper

References (19)

1. Proc. EuroConference on Combinatorics, Graph Theory and Applications (COMB'01), Electronic Notes in Discrete Mathematics, to appear.
2. A. Aggarwal, M. Klawe, and P. Shor. Multilayer grid embeddings for VLSI. Algorithmica, 6(1):129-151, 1991.
3. T. Biedl. 1-bend 3-D orthogonal box-drawings: Two open problems solved. J. Graph Algorithms Appl., 5(3):1-15, 2001.
4. T. Biedl, T. Thiele, and D. R. Wood. Three-dimensional orthogonal graph drawing with optimal volume. In J. Marks, editor, Proc. Graph Drawing: 8th International Symp. (GD'00), volume 1984 of Lecture Notes in Comput. Sci., pages 284-295. Springer, 2001.
5. T. C. Biedl. Three approaches to 3D-orthogonal box-drawings. In S. Whitesides, editor, Proc. Graph Drawing: 6th International Symp. (GD'98), volume 1547 of Lecture Notes in Comput. Sci., pages 30-43. Springer, 1998.
6. T. C. Biedl and M. Kaufmann. Area-efficient static and incremental graph drawings. In R. Burkhard and G. Woeginger, editors, Proc. Algorithms: 5th Annual European Symp. (ESA'97), volume 1284 of Lecture Notes in Comput. Sci., pages 37-52. Springer, 1997.
7. T. C. Biedl, T. Shermer, S. Whitesides, and S. Wismath. Bounds for orthogonal 3-D graph drawing. J. Graph Algorithms Appl., 3(4):63-79, 1999.
8. F. R. K. Chung, F. T. Leighton, and A. L. Rosenberg. Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J. Algebraic Discrete Methods, 8(1):33-58, 1987.
9. R. P. Dilworth. A decomposition theorem for partially ordered sets. Ann. of Math. (2), 51:161-166, 1950.
10. S. L. Hakimi and O. Kariv. A generalization of edge-coloring in graphs. J. Graph Theory, 10(2):139-154, 1986.
11. L. S. Heath and A. L. Rosenberg. Laying out graphs using queues. SIAM J. Comput., 21(5):927-958, 1992.
12. E. S. Kuh, T. Kashiwabara, and T. Fujisawa. On optimum single-row routing. IEEE Trans. Circuits and Systems, 26(6):361-368, 1979.
13. S. M. Malitz. Genus g graphs have pagenumber O(√g). J. Algorithms, 17(1):85-109, 1994.
14. S. M. Malitz. Graphs with E edges have pagenumber O(√E). J. Algorithms, 17(1):71-84, 1994.
15. F. Malucelli and S. Nicoloso. Optimal partition of a bipartite graph into non-crossing matchings. In [1].
16. R. Tarjan. Sorting using networks of queues and stacks. J. Assoc. Comput. Mach., 19:341-346, 1972.
17. V. G. Vizing. On an estimate of the chromatic class of a p-graph. Diskret. Analiz No., 3:25-30, 1964.
18. D. R. Wood. Three-dimensional orthogonal graph drawings with one bend per edge. Submitted. See Three-Dimensional Orthogonal Graph Drawing. Ph.D. thesis, School of Computer Science and Software Engineering, Monash University, Australia, 2000.
19. D. R. Wood. Geometric thickness in a grid of linear area. In [1].