Parallel algorithms for series parallel graphs and graphs with treewidth two

Algorithmica (New York)

Volumn 29, Issue 4, 2001, Pages 534-559

  Bodlaender, H L ^a   Van Antwerpen De Fluiter, B ^a,b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b ALTERA CORPORATION   (United States)

Author keywords

Graph algorithms; Parallel algorithms; Partial k trees; Series parallel graphs; Treewidth

Indexed keywords

GRAPH THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

SERIES PARALLEL GRAPHS;

PARALLEL ALGORITHMS;

EID: 0242364685     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010070     Document Type: Article

References (20)

1. S. Amborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. J. Assoc. Comput. Mach., 40:1134-1164, 1993.
2. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12:308-340, 1991.
3. M. W. Bern, E. L. Lawler, and A. L. Wong. Linear time computation of optimal subgraphs of decomposable graphs. J. Algorithms, 8:216-235, 1987.
4. H. L. Bodlaender. NC-algorilhms for graphs with small treewidth. In J. van Leeuwen, editor, Proc. 14th Workshop on Graph Theoretic Concepts in Computer Science, WG '88, pages 1-10. Lecture Notes in Computer Science, vol. 344, Springer-Verlag, Berlin, 1989.
5. H. L. Bodlaender and B. de Fluiter. Reduction algorithms for constructing solutions in graphs with small treewidth. In J.-Y. Cai and C. K. Wong, editors, Proc. 2nd Annual International Conference on Computing and Combinatorics, COCOON '96, pages 199-208. Lecture Notes in Computer Science, vol. 1090, Springer-Verlag, Berlin, 1996.
6. H. L. Bodlaender and T. Hagerup. Parallel algorithms with optimal speedup for bounded treewidth. SIAM J. Comput., 27:1725-1746, 1998.
7. R. B. Borie, R. G. Parker, and C. A. Tovey. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7:555-581, 1992.
8. N. Chandrasekharan. Fast Parallel Algorithms and Enumeration Techniques for Partial k-Trees. Ph.D. thesis, Clemson University, 1989.
9. N. Chandrasekharan and S. T. Hedetniemi. Fast parallel algorithms for tree decomposing and parsing partial k-trees. In Proc. 26th Annual Allerton Conference on Communication, Control, and Computing, pages 283-292, Urbana-Champaign, Illinois, 1988.
10. B. Courcelle. The monadic second-order logic of graphs, I: Recognizable sets of finite graphs. Inform. and Comput., 85:12-75, 1990.
11. B. de Fluiter. Algorithms for Graphs of Small Treewidth. Ph.D. thesis, Utrecht University, 1997.
12. B. de Fluiter and H. L. Bodlaender. Parallel Algorithms for Graphs of Treewidth Two. Technical Report UU-CS-1997-23, Dept. of Computer Science, Utrecht University, 1997.
13. R. J. Duffin. Topology of series-parallel graphs. J. Math. Anal. Appl., 10:303-318, 1965.
14. D. Eppstein. Parallel recognition of series parallel graphs. Inform, and Comput., 98:41-55, 1992.
15. D. Granot and D. Skorin-Kapov. NC algorithms for recognizing partial 2-trees and 3-trees. SIAM J. Discrete Methods, 4(3):342-354, 1991.
16. X. He. Efficient parallel algorithms for series-parallel graphs. J. Algorithms, 12:409-430, 1991.
17. X. He and Y. Yesha. Parallel recognition and decomposition of two terminal series parallel graphs. Inform. and Comput., 75:15-38, 1987.
18. T. Kikuno, N. Yoshida, and Y. Kakuda. A linear algorithm for the domination number of a series-parallel graph. Discrete Appl. Math., 5:299-311, 1983.
19. K. Takamizawa, T. Nishizeki, and N. Saito. Linear-time computability of combinatorial problems on series-parallel graphs. J. Assoc. Comput. Mach., 29:623-641, 1982.
20. J. Valdes, R. E. Tarjan, and E. L. Lawler. The recognition of series parallel digraphs. SIAM J. Comput., 11:298-313, 1982.