A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths

  • Stefan Arnborg
  • Andrzej Proskurowski
Structure and Logic of Graphs
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1073)


Regarding members of a class of graphs as values of algebraic expressions allows definition of a congruence such that the given class is the union of some of the equivalence classes. In many cases this congruence has a finite number of equivalence classes. Such a congruence can be used to generate a reduction system that decides the class membership in linear time. However, a congruence for a given problem is often difficult to determine.

We describe a technique that produces an algebra and a congruence relation on its carrier for some classes of graphs. Our technique builds on considering possible representations of the generated graphs as graphs of the desired class. By introduction of a labeling describing the “most parsimonious” such representations, we can work with small labeled graphs instead of large unlabeled ones, and some of the case analysis can be delegated to the algebraic machinery used. The congruence relation is subsequently used to construct a labeled graph reduction system based on a reduction system recognizing a larger class than the one sought.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Arnborg, B. Courcelle, A. Proskurowski and D. Seese, An algebraic theory of graph reduction, J. ACM 40 (1993), 1134–1164Google Scholar
  2. 2.
    S. Arnborg, J. Lagergren and D. Seese, Problems easy for tree-decomposable graphs, J. of Algorithms 12, (1991), 308–340Google Scholar
  3. 3.
    S. Arnborg and A. Proskurowski, Canonical representations of partial 2-and 3-trees, BIT 32 (1992), 197–214Google Scholar
  4. 4.
    S. Arnborg, A. Proskurowski, and D. Seese, Monadic second order logic, tree automata and forbidden minors, in Proceedings of the 4th Computer Science Logic Workshop, E.Börger and H. Kleine Buning, Eds., Springer-Verlag LNCS 533, 1–16 (1991)Google Scholar
  5. 5.
    M. Bauderon and B. Courcelle, Graph expressions and graph rewritings, Mathematical Systems Theory 20 (1987), 83–127Google Scholar
  6. 6.
    H. Bodlaender, On reduction algorithms for graphs with small treewidth, Proc. 19th Workshop on Graph-Theoretic Concepts in Computer Science, Springer Verlag, LNCS 790, 45–56 (1993)Google Scholar
  7. 7.
    B. Courcelle, The monadic second-order logic of graphs I: recognizable sets of finite graphs, Information and Computation 85 (1990), 12–75Google Scholar
  8. 8.
    B. Courcelle, The Monadic Second-Order Logic of Graphs III: Tree-Decompositions, Minors and Complexity Issues, Informatique Théorique et Applications 26 (1992), 257–286.Google Scholar
  9. 9.
    R.P. Dilworth, A decomposition theorem for partially ordered sets, Ann. of Mathematics 51 (1951), 161–166Google Scholar
  10. 10.
    Graetzer, Universal Algebra, Springer Verlag, 1979Google Scholar
  11. 11.
    N. Kinnersley and M. Langston, Obstruction set isolation for the gate matrix layout problem, Discrete Applied Mathematics 54, 169–214 (1994)Google Scholar
  12. 12.
    N.M. Korneyenko, Combinatorial algorithms on a class of graphs, Discrete Applied Mathematics 54, 215–218 (1994)Google Scholar
  13. 13.
    D. Kozen, On the Myhill-Nerode theorem for trees, Bulletin of the EATCS 47, 170–173Google Scholar
  14. 14.
    D. Rose, On simple characterization of k-trees, Discrete Mathematics 7, 317–22 (1974)Google Scholar
  15. 15.
    J. Valdes, E. Lawler and R.E. Tarjan, The recognition of series-parallel digraphs, SIAM J. Computing 11, 298–313 (1982)Google Scholar
  16. 16.
    A. Takahashi, S. Ueno, and Y. Kajitani, Minimal acyclic forbidden minors for the family of graphs with bounded path-width, in Proceedings of SIGAL (1991)Google Scholar
  17. 17.
    J.W. Thatcher and J.B. Write, Generalized finite automata theory with an application to a decision problem in second-order logic, Mathematical Systems Theory 2, 57–81 (1968).Google Scholar
  18. 18.
    A. Wald and C.J. Colbourn, Steiner Trees, Partial 2-trees, and minimum IFI networks, Networks 13, 159–167 (1983).Google Scholar
  19. 19.
    T.V. Wimer, Linear algorithms on k-terminal graphs, PhD Thesis URI-030, Clemson University, Clemson (1988).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Stefan Arnborg
    • 1
  • Andrzej Proskurowski
    • 2
  1. 1.Kungliga Tekniska HögskolanNADAStockholmSweden
  2. 2.Computer Science DepartmentUniversity of OregonEugeneUSA

Personalised recommendations