Skip to main content
SpringerLink
Log in
Book cover

Graph Transformations in Computer Science pp 138–152Cite as

Recognizable sets of graphs of bounded tree-width

  • Conference paper
  • First Online:

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

Abstract

We establish that a set of finite graphs of tree-width at most k is recognizable (with respect to the algebra of graphs with an unbounded number of sources) if and only if it is recognizable with respect to the algebra of graphs with at most k sources. We obtain a somewhat stronger result for sets of simple finite graphs of tree-width at most k.

Supported by ESPRIT-Basic Research Working group “COMPUGRAPH”

Supported by the Swedish Natural Science Research Council

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. Abrahamson and M. Fellows. Finite automata, bounded tree-width and well-quasiordering. In N. Robertson and P. Seymour, editors, Graph Structure Theory. Contemporary Mathematics vol. 147, pages 539–564. AMS, Providence. Rhode Island, 1993.

    Google Scholar 

  2. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. Technical Report LaBRI-90-02, Universite de Bordeaux, Jan. 1990. To appear in JACM, extended abstract in Lec. Notes Comp. Sci. 532:70–83. 1991.

    Google Scholar 

  3. S. Arnborg, J. Lagergren, and D. Seese. Problems easy for tree-decomposable graphs. J. of Algorithms, 12:308–340, 1991.

    Google Scholar 

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

    Google Scholar 

  5. B. Courcelle. The monadic second-order logic of graphs V: On closing the gap between definability and recognizability. Theoret. Comput. Sci. 80:153–202, 1991.

    Google Scholar 

  6. B. Courcelle. The monadic second-order logic of graphs III: Tree-decompositions. minors and complexity issues. Informatique Théorique et Applications, 26:257–286, 1992.

    Google Scholar 

  7. B. Courcelle. Recognizable sets of graphs: equivalent definitions and closure properties. Technical Report 92-06, Bordeaux-1 University, 1992. To appear in Mathematical Structures in Computer Science.

    Google Scholar 

  8. A. Habel, H.J. Kreowski, and C. Lautemann. A comparison of compatible. finite. and inductive graph properties. Theoret. Comput. Sci., 89:33–62, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique (associé au CNRS), Bordeaux-1 University, 351 cours de la Libération, 33405, Talence, France

    Bruno Courcelle

  2. The Royal Institute of Technology NADA, KTH, S-100 44, Stockholm, Sweden

    Jens Lagergren

Authors
  1. Bruno Courcelle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jens Lagergren
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans Jürgen Schneider Hartmut Ehrig

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Courcelle, B., Lagergren, J. (1994). Recognizable sets of graphs of bounded tree-width. In: Schneider, H.J., Ehrig, H. (eds) Graph Transformations in Computer Science. Lecture Notes in Computer Science, vol 776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57787-4_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-57787-4_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57787-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation