Improved self-reduction algorithms for graphs with bounded treewidth
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 232-244
- https://doi.org/10.1007/3-540-52292-1_17
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- The monadic second-order logic of graphs, II: Infinite graphs of bounded widthTheory of Computing Systems, 1988
- Min cut is NP-complete for edge weighted treesTheoretical Computer Science, 1988
- Nonconstructive tools for proving polynomial-time decidabilityJournal of the ACM, 1988
- The complexity of searching a graphJournal of the ACM, 1988
- Nonconstructive advances in polynomial-time complexityInformation Processing Letters, 1987
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Graph minors. VI. Disjoint paths across a discJournal of Combinatorial Theory, Series B, 1986
- Searching and pebblingTheoretical Computer Science, 1986
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985