Tree-partitions of k-trees with applications in graph layout

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

Volumn 2880, Issue , 2003, Pages 205-217

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

^a MCGILL UNIVERSITY   (Canada)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; QUEUEING THEORY;

GRAPH LAYOUT; GRID DRAWING; OTHER PROPERTIES; POSITIVE RESOLUTIONS; QUEUE LAYOUT; QUEUE-NUMBER; SINGLE VERTEX; TREE-PARTITION;

FORESTRY;

ALGORITHMS; FORESTS; PROBLEM SOLVING;

EID: 0345254986     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39890-5_18     Document Type: Article

References (22)

1. S. ARNBORG and A. PROSKUROWSKI. Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23(1):11-24, 1989.
2. R. F. COHEN, P. EADES, T. LIN, and F. RUSKEY. Three-dimensional graph drawing. Algorithmic 17(2):199-208, 1996.
3. E. DI GIACOMO, G. LIOTTA, and S. WISMATH. Drawing series-parallel graphs on a box. In Proc. 14th Canadian Conf. on Computational Geometry (CCCG '02), pages 149-153. The Univ. of Lethbridge, Canada, 2002.
4. G. DING and B. OPOROWSKI. Some results on tree decomposition of graphs. J. Graph Theory 20(4):481-499, 1995.
5. V. DUJMOVIĆ, P. MORIN, and D. R. WOOD. Path-width and three-dimensional straight-line grid drawings of graphs. In Proc. 10th Symp. on Graph Drawing (GD '02), LNCS 2628:42-53, Springer, 2002.
6. V. DUJMOVIĆ and D. R. WOOD. Tree-partitions of k-trees with applications in graph layout. Technical Report TR-02-03, School of Computer Science, Carleton Univ., Ottawa, Canada, 2002.
7. V. DUJMOVIĆ and D. R. WOOD. Three-Dimensional Grid Drawings with Sub-Quadratic Volume. In Proc. 11th Symp. on Graph Drawing (GD '03), LNCS, Springer, to appear.
8. Also in: Towards a Theory of Geometric Graphs, Contemporary Mathematics, Amer. Math. Soc., to appear.
9. S. FELSNER, G. LIOTTA, and S. WISMATH. Straight-line drawings on restricted integer grids in two and three dimensions. In Proc. 9th Symp. on Graph Drawing (GD '01), LNCS 2265:328-342, Springer, 2002.
10. J. L. GANLEY and L. S. HEATH. The pagenumber of k-trees is O(k). Discrete Appl. Math. 109(3):215-221, 2001.
11. A. GYÁRFÁS and D. WEST. Multitrack interval graphs. In 26th Southeastern Conf. on Combinat., Graph Theory and Comput., Congr. Numer. 109:109-116, 1995.
12. L. S. HEATH, F. T. LEIGHTON, and A. L. ROSENBERG. Comparing queues and stacks as mechanisms for laying out graphs. SIAM J. Disc. Math. 5:398-412, 1992.
13. L. S. HEATH and A. L. ROSENBERG. Laying out graphs using queues. SIAM J. Comput. 21(5):927-958, 1992.
14. Y. LIN, and X. LI. Pagenumber and treewidth. Disc. Applied Math., to appear.
15. J. PACH, T. THIELE, and G. TÓTH. Three-dimensional grid drawings of graphs. In Proc. 5th Symp. on Graph Drawing (GD '97), LNCS 1353:47-51, Springer, 1997.
16. Also in: Advances in discrete and computational geometry, Contemporary Mathematics 223:251-255, Amer. Math. Soc., 1999.
17. S. V. PEMMARAJU. Exploring the Powers of Stacks and Queues via Graph Layouts. PhD thesis, Virginia Polytechnic Institute and State Univ., Virginia, U.S.A., 1992.
18. B. A. REED. Algorithmic aspects of tree width. In Recent advances in algorithms and combinatorics, pages 85-107, Springer, 2003.
19. S. RENGARAJAN and C. E. VENI MADHAVAN. Stack and queue number of 2-trees. In Proc. 1st Conf. on Computing and Combinatorics (COCOON '95), LNCS 959:203-212, Springer, 1995.
20. D. J. ROSE, R. E. TARJAN, and G. S. LEUKER. Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5:266-283, 1976.
21. D. SEESE. Tree-partite graphs and the complexity of algorithms. In Proc. Conf. Fundamentals of Computation Theory, LNCS 199:412-421, Springer, 1985.
22. D. R. WOOD. Queue layouts, tree-width, and three-dimensional graph drawing. In Proc. 22nd Foundations of Software Technology and Theoretical Computer Science (FST TCS '02), LNCS 2556:348-359, Springer, 2002.