Better algorithms for the pathwidth and treewidth of graphs

This publication has 18 references indexed in Scilit:

• The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
  Information and Computation, 1990
• Improved self-reduction algorithms for graphs with bounded treewidth
  Published by Springer Nature ,1990
• Linear time algorithms for NP-hard problems restricted to partial k-trees
  Discrete Applied Mathematics, 1989
• On search decision and the efficiency of polynomial-time algorithms
  Published by Association for Computing Machinery (ACM) ,1989
• An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• Linear-time computation of optimal subgraphs of decomposable graphs
  Journal of Algorithms, 1987
• Complexity of Finding Embeddings in a k-Tree
  SIAM Journal on Algebraic Discrete Methods, 1987
• Characterization and Recognition of Partial 3-Trees
  SIAM Journal on Algebraic Discrete Methods, 1986
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
  BIT Numerical Mathematics, 1985
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
  ACM Transactions on Mathematical Software, 1983