Decomposition trees: Structured graph representation and efficient algorithms

This publication has 8 references indexed in Scilit:

• Problems easy for tree-decomposable graphs extended abstract
  Published by Springer Nature ,1988
• Complexity of Finding Embeddings in a k-Tree
  SIAM Journal on Algebraic Discrete Methods, 1987
• String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
  Discrete Applied Mathematics, 1987
• May we introduce to you: Hyperedge replacement
  Published by Springer Nature ,1987
• Graph minors. II. Algorithmic aspects of tree-width
  Journal of Algorithms, 1986
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
  Information and Control, 1986
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
  BIT Numerical Mathematics, 1985
• Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
  Information Processing Letters, 1982