Decomposition trees: Structured graph representation and efficient algorithms

  • Clemens Lautemann
Tree Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 299)


A data structure, decomposition trees, is introduced, which enables graphs to be represented in a certain structured way, and which leads to simple, recursive algorithms for many difficult graph problems.

For a number of NP-complete problems these algorithms are shown to run in linear time on decomposition trees with bounded label size. Furthermore it is shown that for those graphs which have decomposition tree representations with bounded label size such a representation can be constructed in polynomial time.

Put together, these algorithms solve a number of NP-complete problems in polynomial time on many graph classes, including all those graph languages that can be generated by any sort of context-free graph grammars, e.g., (hyper-)edge replacement grammars.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ar85]
    S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability — a survey. BIT 25 (1985), pp.2–23.Google Scholar
  2. [ACP87]
    S. Arnborg, D. Corneil, A. Proskurowski, Complexity of finding embeddings in a k-tree. SIAM J.Alg.Disc.Meth. 8 (1987), pp.277–284.Google Scholar
  3. [ALS87]
    S.Arnborg, J.Lagergren, D.Seese, Which problems are easy for tree-decomposable graphs? Draft, November 1987.Google Scholar
  4. [GJ79]
    M. Garey, D. Johnson, Computers and intractability. Freeman, N.Y., 1979.Google Scholar
  5. [HK87a]
    A. Habel, H.-J. Kreowski, Some structural aspects of hypergraph languages generated by hyperedge replacement. LNCS 247 (1987), pp.207–219.Google Scholar
  6. [HK87b]
    A.Habel, H.-J.Kreowski, May we introduce to you: Hyperedge replacement. Proc. 3rd international workshop on graph grammars and their applications to Computer Science, to appear.Google Scholar
  7. [Kr86]
    H.-J.Kreowski, Rule trees can help to escape hard graph problems. Preprint, Universität Bremen, 1986.Google Scholar
  8. [LW87]
    K.-J. Lange, E. Welzl, String grammars with disconnection. Discr.Appl.Math. 16 (1987), pp.17–30.Google Scholar
  9. [Le86]
    T. Lengauer, Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs. LNCS 216 (1986), pp.153–170.Google Scholar
  10. [RS86]
    N. Robertson, P. Seymour, Graph minors. II. Algorithmic aspects of tree-width. J.Algorithms 7 (1986), pp.309–322.Google Scholar
  11. [RW86]
    G. Rozenberg, E. Welzl, Boundary NLC grammars — basic definitions, normal forms and complexity. Information and Control 69 (1986), pp.136–167.Google Scholar
  12. [Sl82]
    A.O. Slisenko, Context-free graph grammars as a tool for describing polynomial-time subclasses of hard problems. Inf.Proc.Let. 14 (1982), pp.52–56.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Clemens Lautemann
    • 1
  1. 1.Fachbereich Mathematik/InformatikUniversität BremenBremen 33

Personalised recommendations