Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1997: Automata, Languages and Programming pp 627–637Cite as

Constructive linear time algorithms for branchwidth

  • Session 15: Algorithms III
  • Conference paper
  • First Online:

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

Abstract

Let G k be the class of graphs with branchwidth at most k. In this paper we prove that one can construct, for any k, a linear time algorithm that checks if a graph belongs to G k and, if so, outputs a branch decomposition of minimum width. Moreover, we find the obstruction set for G k and, for the same class, we give a safe and complete set of reduction rules. Our results lead to a practical linear time algorithm that checks if a graph has branchwidth ≤3 and, if so, outputs a branch decomposition of minimum width.

The secont author was supported by the Training and Mobility of Researchers (TMR) Program, (EU contract no ERBFMBICT950198).

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. R. Abrahamson and M. R. Fellows. Finite automata, bounded treewidth and well-quasiordering. In N. Robertson and P. Seymour, editors, Proceedings of the AMS Summer Workshop on Graph Minors, Graph Structure Theory, Contemporary Mathematics vol. 147, pages 539–564. American Mathematical Society, 1993.

    Google Scholar 

  2. S. Arnborg, D. G. Cornell, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth., 8:277–284, 1987.

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  5. S. Arnborg, A. Proskurowski, and D. G. Corneil. Forbidden minors characterization of partial 3-trees. Disc. Math., 80:1–19, 1990.

    Article  Google Scholar 

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

    Article  Google Scholar 

  7. 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.

    Google Scholar 

  8. H. L. Bodlaender and T. Kloks. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms, 21:358–402, 1996.

    Article  Google Scholar 

  9. H. L. Bodlaender, T. Kloks, and D. Kratsch. Treewidth and pathwidth of permutation graphs. In Proceedings 20th International Colloquium on Automata, Languages and Programming, pages 114–125, Berlin, 1993. Springer Verlag, Lecture Notes in Computer Science, vol. 700.

    Google Scholar 

  10. W. Cook, 1996. Personal communication.

    Google Scholar 

  11. W. Cook and P. D. Seymour. An algorithm for the ring-routing problem. Bellcore technical memorandum, Bellcore, 1993.

    Google Scholar 

  12. Y. Kajitani, A. Ishizuka, and S. Ueno. A characterization of the partial k-tree in terms of certain substructures. Graphs and Combinatorics, 2:233–246, 1986.

    Article  Google Scholar 

  13. J. Lagergren and S. Arnborg. Finding minimal forbidden minors using a finite congruence. In Proceedings of the 18th International Colloquium on Automata, Languages and Programming, pages 532–543. Springer Verlag, Lecture Notes in Computer Science, vol. 510, 1991.

    Google Scholar 

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

    Article  Google Scholar 

  15. J. Matousek and R. Thomas. On the complexity of finding iso-and other morphisms for partial k-trees. Disc. Math., 108:343–364, 1992.

    Article  Google Scholar 

  16. N. Robertson and P. D. Seymour. Graph minors — a survey. In I. Anderson, editor, Surveys in Combinatorics, pages 153–171. Cambridge Univ. Press, 1985.

    Google Scholar 

  17. N. Robertson and P. D. Seymour. Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory Series B, 52:153–190, 1991.

    Article  Google Scholar 

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

    Article  Google Scholar 

  19. A. Satyanarayana and L. Tung. A characterization of partial 3-trees. Networks, 20:299–322, 1990.

    Google Scholar 

  20. P. D. Seymour and R. Thomas. Call routing and the ratcatcher. Combinatorica, 14(2):217–241, 1994.

    Article  Google Scholar 

  21. J. van Leeuwen. Graph algorithms. In Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory, pages 527–631, Amsterdam, 1990. North Holland Publ. Comp.

    Google Scholar 

  22. J. A. Wald and C. J. Colbourn. Steiner trees, partial 2-trees, and minimum IFI networks. Networks, 13:159–167, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508, TB Utrecht, The Netherlands

    Hans L. Bodlaender & Dimitrios M. Thilikos

Authors
  1. Hans L. Bodlaender
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dimitrios M. Thilikos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pierpaolo Degano Roberto Gorrieri Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bodlaender, H.L., Thilikos, D.M. (1997). Constructive linear time algorithms for branchwidth. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_217

Download citation

  • DOI: https://doi.org/10.1007/3-540-63165-8_217

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63165-1

  • Online ISBN: 978-3-540-69194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation