Path-width and three-dimensional straight-line grid drawings of graphs

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

Volumn 2528 LNCS, Issue , 2002, Pages 42-53

  Dujmović, Vida ^a   Morin, Pat ^b   Wood, David R ^b  

^a MCGILL UNIVERSITY   (Canada)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ASPECT RATIO; DRAWING (GRAPHICS); GRAPHIC METHODS; TREES (MATHEMATICS);

GRID DRAWING; N-VERTEX GRAPH; PLANAR GRAPH; SERIES-PARALLEL GRAPH; TREE-WIDTH;

TREES (MATHEMATICS); GRAPH THEORY;

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

References (38)

1. H. L. BODLAENDER, A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25(6):1305-1317, 1996.
2. H. L. BODLAENDER, A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci., 209(1-2):1-45, 1998.
3. F. J. BRANDENBURG, ed., Proc. International Symp. on Graph Drawing (GD '95), vol. 1027 of Lecture Notes in Comput. Sci., Springer, 1996.
4. I. BRUß AND A. FRICK, Fast interactive 3-D graph visualization. In [3], pp. 99-110.
5. T. CALAMONERI and A. STERBINI, 3D straight-line grid drawing of 4-colorable graphs. Inform. Process. Lett., 63(2):97-102, 1997.
6. K. CHILAKAMARRI, N. DEAN, AND M. LITTMAN, Three-dimensional Tutte embedding. In Proc. 26th Southeastern International Conf. on Combinatorics, Graph Theory and Computing, vol. 107 of Cong. Numer., pp. 129-140, 1995.
7. M. CHROBAK, M. GOODRICH, AND R. TAMASSIA, Convex drawings of graphs in two and three dimensions. In Proc. 12th Annual ACM Symp. on Comput. Geom., pp. 319-328, 1996.
8. R. F. COHEN, P. EADES, T. LIN, AND F. RUSKEY, Three-dimensional graph drawing. Algorithmica, 17(2):199-208, 1996.
9. I. F. CRUZ and J. P. TWAROG, 3D graph drawing with simulated annealing. In [3], pp. 162-165.
10. H. DE FRAYSSEIX, J. PACH, AND R. POLLACK, Howto drawa planar graph on a grid. Combinatorica, 10(1):41-51, 1990.
11. E. DI GIACOMO, G. LIOTTA, AND S. WISMATH, Drawing series-parallel graphs on a box. In S. Wismath, ed., Proc. 14th Canadian Conf. on Computational Geometry (CCCG '02), The University of Lethbridge, Canada, 2002.
12. R. G. DOWNEY AND M. R. FELLOWS, Parameterized complexity. Springer, 1999.
13. V. DUJMOVIĆ, M. FELLOWS, M. HALLETT, M. KITCHING, G. LIOTTA, C. MCCARTIN, N. NISHIMURA, P. RAGDE, F. ROSEMAND, M. SUDERMAN, S. WHITESIDES, AND D. R. WOOD, On the parameterized complexity of layered graph drawing. In F. Meyer auf der Heide, ed., Proc. 5th Annual European Symp. on Algorithms (ESA '01), vol. 2161 of Lecture Notes in Comput. Sci., pp. 488-499, Springer, 2001.
14. V. DUJMOVIĆ AND D. R. WOOD, Tree-partitions of k-trees with applications in graph layout. Tech. Rep. TR-02-03, School of Computer Science, Carleton University, Ottawa, Canada, 2002.
15. P. EADES AND P. GARVAN, Drawing stressed planar graphs in three dimensions. In [3], pp. 212-223.
16. P. ERDÖS, APPENDIX. In K. F. ROTH, On a problem of Heilbronn. J. London Math. Soc., 26:198-204, 1951.
17. S. FELSNER, S. WISMATH, AND G. LIOTTA, Straight-line drawings on restricted integer grids in two and three dimensions. In [28], pp. 328-342.
18. A. GARG, R. TAMASSIA, AND P. VOCCA, Drawing with colors. In J. Diaz and M. Serna, eds., Proc. 4th Annual European Symp. on Algorithms (ESA '96), vol. 1136 of Lecture Notes in Comput. Sci., pp. 12-26, Springer, 1996.
19. A. GUPTA AND N. NISHIMURA, Sequential and parallel algorithms for embedding problems on classes of partial k-trees. In Proc. 4th Scandinavian Workshop on Algorithm Theory (SWAT '94), vol. 824 of Lecture Notes in Comput. Sci., pp. 172-182, Springer, 1984.
20. A. GUPTA, N. NISHIMURA, A. PROSKUROWSKI, AND P. RAGDE, Embeddings of k-connected graphs of pathwidth k. In M. M. Halldorsson, ed., Proc. 7th Scandinavian Workshop on Algorithm Theory (SWAT '00), vol. 1851 of Lecture Notes in Comput. Sci., pp. 111-124, Springer, 2000.
21. P. HLINĚNÝ, Crossing-critical graphs and path-width. In [28], pp. 102-114.
22. S.-H. HONG, Drawing graphs symmetrically in three dimensions. In [28], pp. 189-204.
23. S.-H. HONG AND P. EADES, An algorithm for finding three dimensional symmetry in series parallel digraphs. In D. Lee and S.-H. Teng, eds., Proc. 11th International Conf. on Algorithms and Computation (ISAAC '00), vol. 1969 of Lecture Notes in Comput. Sci., pp. 266-277, Springer, 2000.
24. S.-H. HONG AND P. EADES, An algorithm for finding three dimensional symmetry in trees. In J. Marks, ed., Proc. 8th International Symp. on Graph Drawing (GD '00), vol. 1984 of Lecture Notes in Comput. Sci., pp. 360-371, Springer, 2001.
25. S.-H. Hong, P. Eades, A. Quigley, and S.-H. Lee, Drawing algorithms for series-parallel digraphs in two and three dimensions. In S. Whitesides, ed., Proc. 6th International Symp. on Graph Drawing (GD '98), vol. 1547 of Lecture Notes in Comput. Sci., pp. 198-209, Springer, 1998.
26. F. T. LEIGHTON AND A. L. ROSENBERG, Three-dimensional circuit layouts. SIAM J. Comput., 15(3):793-813, 1986.
27. B. MONIEN, F. RAMME, AND H. SALMEN, A parallel simulated annealing algorithm for generating 3D layouts of undirected graphs. In [3], pp. 396-408.
28. P. MUTZEL, M. JÜNGER, AND S. LEIPERT, eds., Proc. 9th International Symp. on Graph Drawing (GD '01), vol. 2265 of Lecture Notes in Comput. Sci., Springer, 2002.
29. D. I. OSTRY, Some Three-Dimensional Graph Drawing Algorithms. Master's thesis, Department of Computer Science and Software Engineering, The University of Newcastle, Australia, 1996.
30. J. PACH, T. THIELE, AND G. TÓTH, Three-dimensional grid drawings of graphs. In G. Di Battista, ed., Proc. 5th International Symp. on Graph Drawing (GD '97), vol. 1353 of Lecture Notes in Comput. Sci., pp. 47-51, Springer, 1998.
31. Z. PENG, Drawing Graphs of Bounded Treewidth/Pathwidth. Master's thesis, Department of Computer Science, University of Auckland, NewZealand, 2001.
32. T. PORANEN, A newalgorithm for drawing series-parallel digraphs in 3D. Tech. Rep. A-2000-16, Dept. of Computer and Information Sciences, University of Tampere, Finland, 2000.
33. W. SCHNYDER, Planar graphs and poset dimension. Order, 5(4):323-343, 1989.
34. M. THORUP, All structured programs have small tree-width and good register allocation. Information and Computation, 142(2):159-181, 1998.
35. C. WARE AND G. FRANCK, Viewing a graph in a virtual reality display is three times as good as a 2D diagram. In A. L. Ambler and T. D. Kimura, eds., Proc. IEEE Symp. Visual Languages (VL '94), pp. 182-183, IEEE, 1994.
36. C. WARE, D. HUI, AND G. FRANCK, Visualizing object oriented software in three dimensions. In Proc. IBM Centre for Advanced Studies Conf. (CASCON '93), pp. 1-11, 1993.
37. R. WEISKIRCHER, Drawing planar graphs. In M. KAUFMANN AND D. WAGNER, eds., Drawing Graphs: Methods and Models, vol. 2025 of Lecture Notes in Comput. Sci., pp. 23-45, Springer, 2001.
38. D. R. WOOD, Queue layouts, tree-width, and three-dimensional graph drawing. Tech. Rep. TR-02-02 (revised), School of Computer Science, Carleton University, Ottawa, Canada, August, 2002.