Skip to main content
SpringerLink
Log in

Parallel algorithms for treewidth two

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1335))

Included in the following conference series:

Abstract

In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most two, and if so, constructs a tree decomposition or path decomposition of minimum width of G. The algorithm uses O(n) operations and O(log n log* n) time on an EREW PRAM, or O(log n) time on a CRCW PRAM. The algorithm makes use of the resemblance between series-parallel graphs and partial two-trees. It is a (non-trivial) extension of the parallel algorithm for series-parallel graphs that is presented in [6].

This research was carried out while the first author was working at the Department of Computer Science at Utrecht University, with support by the Foundation for Computer Science (S.I.O.N) of the Netherlands Organization for Scientific Research (N.W.O.). This research was partially supported by ESPRIT Long Term Research Project 20244 (project ALCOM IT: Algorithms and Complexity in Information Technology).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. R. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka. A simple parallel tree contraction algorithm. J. Algorithms, 10:287–302, 1989.

    Google Scholar 

  2. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. J. ACM, 40:1134–1164, 1993.

    Google Scholar 

  3. S. Arnborg and A. Proskurowski. Characterization and recognition of partial 3trees. SIAM J. Alg. Disc. Meth., 7:305–314, 1986.

    Google Scholar 

  4. H. L. Bodlaender. NC-algorithms for graphs with small treewidth. In J. van Leeuwen, editor, Proceedings 14th International Workshop on Graph-Theoretic Concepts in Computer Science WG'88, pages 1–10. Springer Verlag, Lecture Notes in Computer Science, vol. 344, 1988.

    Google Scholar 

  5. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25:1305–1317, 1996.

    Google Scholar 

  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.

    Google Scholar 

  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 Combinatorics, COCOON'96, pages 199–208. Springer Verlag, Lecture Notes in Computer Science, vol. 1090, 1996.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  10. B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12–75, 1990.

    Google Scholar 

  11. B. de Fluiter. Algorithms for Graphs of Small Treewidth. PhD thesis, Utrecht University, 1997.

    Google Scholar 

  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.

    Google Scholar 

  13. R. J. Duffin. Topology of series-parallel graphs. J. Math. Anal. Appl., 10:303–318, 1965.

    Google Scholar 

  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.

    Google Scholar 

  15. J. Lagergren. Efficient parallel algorithms for graphs of bounded tree-width. J. Algorithms, 20:20–44, 1996.

    Google Scholar 

  16. J. Matoušek and R. Thomas. Algorithms finding tree-decompositions of graphs. J. Algorithms, 12:1–22, 1991.

    Google Scholar 

  17. N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of treewidth. J. Algorithms, 7:309–322, 1986.

    Google Scholar 

  18. D. P. Sanders. On linear recognition of tree-width at most four. SIAM J. Disc. Meth., 9(1):101–117, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Quantitative Methods, P.O. Box 414, 5600 AK, Eindhoven, the Netherlands

    Babette de Fluiter

  2. Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508, TB Utrecht, the Netherlands

    Hans L. Bodlaender

Authors
  1. Babette de Fluiter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans L. Bodlaender
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rolf H. Möhring

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Fluiter, B., Bodlaender, H.L. (1997). Parallel algorithms for treewidth two. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1997. Lecture Notes in Computer Science, vol 1335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024496

Download citation

  • DOI: https://doi.org/10.1007/BFb0024496

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63757-8

  • Online ISBN: 978-3-540-69643-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation