Parallel algorithms for treewidth two

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

Volumn 1335, Issue , 1997, Pages 157-170

  de Fluiter, Babette ^a   Bodtaender, Hans L ^b  

^a Centre for Quantitative Methods   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ALGORITHMS; PARALLEL ALGORITHMS;

EREW PRAM; GRAPH G; NON-TRIVIAL; PATH DECOMPOSITION; SERIES-PARALLEL GRAPH; TREE DECOMPOSITION; TREE-WIDTH;

TREES (MATHEMATICS);

EID: 26044471384     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0024496     Document Type: Conference Paper

References (18)

1. K. R. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka. A simple parallel tree contraction algorithm. J. Algorithms, 10:287-302, 1989.
2. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. J. ACM, 40:1134-1164, 1993.
3. S. Arnborg and A. Proskurowski. Characterization and recognition of partial 3-trees. SIAM J. Al9. Disc. Meth., 7:305-314, 1986.
4. H. L. Bodlaender. NC-algorithms for graphs with small treewidth. In J. van Leeuwen, editor, Proceedings l4th International Workshop on Graph-Theoretic Concepts in Computer Science WG'88, pages 1-10. Springer Verlag, Lecture Notes in Computer Science, vol. 344, 1988.
5. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25:1305-1317, 1996.
6. H. L. Bodlaender and B. de Fluiter. Parallel algorithms for series parallel graphs. In J. Diaz and M. Serna, editors, Proceedings 4st Annual European Symposium on Algorithms ESA '96, Lecture Notes on Computer Science, vol. 1136, pages 277-289, Berlin, 1996. Springer Verlag.
7. 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, Proceedings 2nd Annual International Conference on Computing and Combinatories, COCOON'96, pages 199-208. Springer Verlag, Lecture Notes in Computer Science, vol. 1090, 1996.
8. H. L. Bodlaender and T. Hagerup. Parallel algorithms with optimal speedup for bounded treewidth. In Z. Fülöp and F. Gécseg, editors, Proceedings 22nd International Colloquium on Automata, Languages and Programming, pages 268-279, Berlin, 1995. Springer-Verlag, Lecture Notes in Computer Science 944. To appear in SIAM J. Computing, 1997.
9. B. Courcelle. Graph rewriting: an algebraic and logical approach. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 192-242, Amsterdam, 1990. North Holland Publ. Comp.
10. B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12-75, 1990.
11. B. de Fluiter. Algorithms for Graphs of Small Treewidth. PhD 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, Utrecht, the Netherlands, 1997.
13. R. J. Duffin. Topology of series-parallel graphs. J. Math. Anal. Appl., 10:303-318, 1965.
14. D. Granot and D. Skorin-Kapov. NC algorithms for recognizing partial 2-trees and 3-trees. SIAM J. Disc. Meth., 4(3):342-354, 1991.
15. J. Lagergren. Efficient parallel algorithms for graphs of bounded tree-width, J. Algorithms, 20:20-44, 1996.
16. J. Matoušek and R. Thomas. Algorithms finding tree-decompositions of graphs. J. Algorithms, 12:1-22, 1991.
17. N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of treewidth. J. Algorithms, 7:309-322, 1986.
18. D. P. Sanders. On linear recognition of tree-width at most four. SIAM J. Disc. Meth., 9(1):101-117, 1996.