Dynamic programming on graphs with bounded treewidth
- 1 January 1988
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- 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
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- Solving NP-hard problems in ‘almost trees’: Vertex coverDiscrete Applied Mathematics, 1985
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location ProblemsJournal of the ACM, 1984
- Steiner trees, partial 2–trees, and minimum IFI networksNetworks, 1983
- A linear algorithm for the domination number of a series-parallel graphDiscrete Applied Mathematics, 1983
- Linear-time computability of combinatorial problems on series-parallel graphsJournal of the ACM, 1982
- The subgraph isomorphism problem for outerplanar graphsTheoretical Computer Science, 1982
- A linear algorithm for the domination number of a treeInformation Processing Letters, 1975