Divide-and-conquer algorithms for graph-layout problems

Networks

Volumn 28, Issue 2, 1996, Pages 69-85

  Swaminathan, Ram ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038971297     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199609)28:2<69::AID-NET1>3.0.CO;2-A     Document Type: Article

References (27)

1. K. Abrahamson and M. R. Fellows, Finite automata, bounded treewidth and well-quasiordering. Graph Structure Theory (N. Robertson and P. Seymour, Eds.), AMS Contemporary Mathematics Series 147. American Mathematical Society, Rhode Island (1993) 539-564.
2. K. Abrahamson and M. R. Fellows, Finite automata, bounded treewidth and well-quasiordering. Graph Structure Theory (N. Robertson and P. Seymour, Eds.), AMS Contemporary Mathematics Series 147. American Mathematical Society, Rhode Island (1993) 539-564.
3. F. Annexstein and R. Swaminathan, Parallel algorithms for series-parallel graphs. Unpublished (1995).
4. H. L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth. Proceedings of the 25th Symposium on Theory of Computing (1993) 226-234.
5. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications. North-Holland, New York (1976).
6. M. H. Chen and S. L. Lee, Linear-time algorithms for k-cutwidth problem. Lecture Notes in Computer Science: Algorithms and Computation 650. Springer-Verlag, New York (1992) 21-30.
7. R. Cole and U. Vishkin, Approximate and exact parallel techniques with applications to list, tree and graph problems. Proceedings of the 27th Symposium on Foundations of Computer Science (1986) 478-491.
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. Alg. Discr. Methods 8(1) (1987) 33-58.
9. W. H. Cunningham and J. Edmonds, A combinatorial decomposition theory. Can. J. Math. 22 (1980) 734-765.
10. D. Eppstein, Parallel recognition of series-parallel graphs. Info. Comput. 98 (1992) 41-55.
11. M. R. Fellows and M. A. Langston, Fast search algorithms for layout permutation problems. Integrat. VLSI J. 12 (1991) 321-337.
12. M. R. Fellows and M. A. Langston, On well-partial-order theory and its application to combinatorial problems of VLSI design. SIAM J. Discr. Math. 5(1) (1992) 117-126.
13. M. R. Garey, R. L. Graham, D. S. Johnson, G. L. Miller, and D. E. Knuth, Complexity results for bandwidth minimization. SIAM J. Appl. Math. 34(3) (1978) 477-495.
14. F. Gavril, Some NP-complete problems on graphs. Proceedings of the 11th Annual Conference on Information Sciences and Systems, The Johns Hopkins University, MD (1977) 91-95.
15. E. M. Gurari and I. H. Sudborough, Improved dynamic programming algorithms for bandwidth minimization and the mincut linear arrangement problem. J. Algor. 5 (1984) 531-546.
16. J. Hopcroft and R. E. Tarjan, Dividing a graph into triconnected components. SIAM J. Comput. 2 (1973) 135-158.
17. F. S. Makedon, C. H. Papadimitriou, and I. H. Sudborough, Topological bandwidth. SIAM J. Alg. Discr. Methods 6 (1985) 418-444.
18. F. Makedon, D. Sheinwald, and Y. Wolfsthal, A simple linear-time algorithm for recognition of bandwidth-2 biconnected graphs. Info. Process. Lett. 46 (1993) 103-107.
19. F. Makedon and I. H. Sudborough, On minimizing width in linear layouts. Discr. Appl. Math. 23 (1989) 243-265.
20. G. L. Miller and J. H. Reif, Parallel tree contraction and its applications. Proceedings of the 26th Symposium on Foundations of Computer Science (1985) 478-489.
21. C. H. Papadimitriou, The NP-completeness of bandwidth minimization problem. Computing 16 (1976) 263-270.
22. J. B. Saxe, Dynamic programming algorithms for recognizing small bandwidth graphs in polynomial time. SIAM J. Alg. Discr. Methods 1 (1980) 363-369.
23. L. Stockmeyer, Private communication to M. Garey and D. S. Johnson, cited in Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, Boston (1974).
24. R. E. Tarjan, Depth-first-search and linear graph algorithms. SIAM J. Comput. 1 (1972) 146-160.
25. W. T. Tutte, Connectivity in Graphs. University of Toronto Press, Toronto (1966).
26. D. K. Wagner, Forbidden subgraphs and graph decomposition. Networks 17 (1987) 105-110.
27. A. Wigderson, The complexity of the Hamiltonian circuit problem for planar graphs. Technical Report 298. Department of Electrical Engineering and Computer Science, Princeton University, NJ (1982).