Efficient Parallel Algorithms for Graphs of Bounded Tree-Width

Journal of Algorithms

Volumn 20, Issue 1, 1996, Pages 20-44

  Lagergren, Jens ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL ALGORITHMS; SEPARATORS; TREES (MATHEMATICS);

ALGORITHM COMPLEXITY; BINARY SEARCH; GRAPH DECOMPOSITION; TREEWIDTH;

GRAPH THEORY;

EID: 0030371952     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0002     Document Type: Article

References (18)

1. K. Abrahamson, N. Dadoun, D. G. Kirkpatrik, and T. Przytycka, A simple parallel tree contraction algorithm, J. Algorithms 10 (1989), 287-302.
2. S. Arnborg, J. Lagergren, and D. Seese, Problems easy for tree-decomposable graphs, J. Algorithms 12 (1991), 308-340.
3. H. L. Bodlaender, NC-algorithms for graphs with bounded tree-width, Technical Report RUU-CS-88-4, University of Utrecht, 1988.
4. H. L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, in "Proceedings of 25th STOC, 1993," pp. 226-234.
5. B. Bollabás, "Graph Theory," Springer-Verlag, New York/Berlin, 1985.
6. J. A. Bondy and U. S. R. Murty, "Graph Theory with Applications," North-Holland, Amsterdam, 1979.
7. N. Chandrasekharan and A. Hedetniemi, Fast parallel algorithms for tree decomposition and parsing partial k-trees, in "26th Annual Allerton Conference on Communication, Control, and Computing, 1989," pp. 283-292.
8. R. Cole and U. Vishkin, Approximate and exact parallel scheduling with applications to list, tree and graph problems, in "Proceedings of 27th FOCS, 1986," pp. 478-496.
9. X. He, Efficient parallel algorithms for series parallel graphs, J. Algorithms 12 (1991), 409-430.
10. X. He and Y. Yesha, Binary tree algebraic computations and parallel algorithms for simple graphs, J. Algorithms 9 (1988), 92-113.
11. R. M. Karp and V. Ramachandran, "Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory," Chap. 17, North-Holland, Amsterdam, 1990.
12. S. Khuller and B. Schieber, Efficient parallel algorithms for testing connectivity and finding disjoint s - t paths in graphs, in "Proceedings of 30th FOCS, 1989," pp. 288-293.
13. J. Lagergren, Algorithms and minimal forbidden minors for tree-decomposable graphs, Ph.D. Thesis, TRITA-NA-910, Royal Institute of Technology, 1991.
14. E. Lawler, "Combinatorial Optimization, Networks and Matroids," Holt, Rinhart and Winston, New York, 1976.
15. N. Robertson and P. D. Seymour, Graph minors II, algorithmic aspects of tree width, J. Algorithms 1 (1986), 309-322.
16. N. Robertson and P. D. Seymour, Graph minors XIII: The disjoint path problem, J. Combin. Theory Ser. B 63 (1995), 65-110.
17. Y. Shiloach and U. Vishkin, An o(log n) parallel connectivity algorithm, J. Algorithms 3 (1982), 57-67.
18. R. E. Tarjan, Efficiency of a good but not linear set union algorithm, Assoc. Comput. Mach., 22(2) (1975), 215-225.