Pathwidth and layered drawings of trees

International Journal of Computational Geometry and Applications

Volumn 14, Issue 3, 2004, Pages 203-225

  Suderman, Matthew ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Graph drawing; Pathwidth; Tree layout

Indexed keywords

EID: 7244219753     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195904001433     Document Type: Article

References (18)

1. G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs (Prentice-Hall, 1999).
2. M. J. Carpano, Automatic display of hierarchized graphs for computer aided decision analysis, IEEE Trans. Systs., Man Cybern. 10(11) (1980) 705-715.
3. S. Cornelsen, T. Schank and D. Wagner, Drawing graphs on two and three lines in Graph Drawing, 10th Int. Symp. (GD 2002), eds. M. Goodrich and S. Kobourov, volume to appear of Lecture Notes in Computer Science (Springer-Verlag, 2002).
4. V. Dujmović, M. R. Fellows, M. T. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. A. Rosamond, M. Suderman, S. Whitesides and D. R. Wood, On the parameterized complexity of layered graph drawing, in Algorithms, 9th European Symp. (ESA 2001), Lecture Notes in Computer Science, eds. F. Meyer auf der Heide, Vol. 2161 (Springer-Verlag, 2001), pp. 488-499.
5. V. Dujmović, M. Suderman and D. R. Wood, Personal communication, 2002.
6. P. Eades, B. McKay and N. Wormald, On an edge crossing problem, in Proc. of the 9th Australian Computer Science Conf. (Australian National University, 1986), pp. 327-334.
7. J. A. Ellis, I. Hal Sudborough and J. Turner, The vertex separation and search number of a graph, Inform. Comput. 113(1) (1994) 50-79.
8. S. Felsner, G. Liotta and S. K. Wismath, Straight-line drawings on restricted integer grids in two and three dimensions (extended abstract), in Graph Drawing, 9th Int. Symp. (GD 2001), Lecture Notes in Computer Science, eds. P. Mutzel, M. Jünger and S. Leipert, Vol. 2265 (Springer-Verlag, 2001), pp. 328-342.
9. S. Felsner, G. Liotta and S. K. Wismath, Straight-line drawings on restricted integer grids in two and three dimensions, accepted in J. Graph Algorith. Appl. (Special Issue), (2003).
10. U. Fößmeier and M. Kaufmann, Algorithms and area bounds for nonplanar orthogonal drawings, in Graph Drawing, 5th Int. Symp. (GD '97), Lecture Notes in Computer Science, ed. G. Di Battista, Vol. 1353 (Springer-Verlag, 1997), pp. 134-145.
11. F. Harary and A. Schwenk, A new crossing number for bipartite graphs, Utilitas Mathematica 1 (1972) 203-209.
12. M. Kaufmann and D. Wagner, Drawing Graphs: Methods and Models, Lecture Notes in Computer Science, Vol. 2025 (Springer-Verlag, 2001).
13. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout (Wiley, 1990).
14. P. Mutzel, Optimization in leveled graphs, in Encyclopedia of Optimization, eds. P. M. Pardalos and C. A. Floudas (Kluwer Academic Publishers, 2001), pp. 189-196.
15. P. Scheffler, A linear algorithm for the pathwidth of trees, in Topics in Combinatorics and Graph Theory, eds. R. Bodendiek and R. Kenn (Physica-Verlag, Heidelberg, 1990), pp. 613-620.
16. K. Sugiyama, S. Tagawa and M. Toda, Methods for visual understanding of hierarchical system structures, IEEE Trans. Syst., Man Cybern. 11(2) (1981) 109-125.
17. J. N. Warfleld, Crossing theory and hierarchy mapping, IEEE Trans. Syst., Man Cybern. 7(7) (1977) 502-523.
18. M. S. Waterman and J. R. Griggs, Interval graphs and maps of DNA, Bull. Math. Biol. 48(2) (1986) 189-195.