Problems easy for tree-decomposable graphs extended abstract
- 1 January 1988
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1987
- Linear-time computation of optimal subgraphs of decomposable graphsJournal of Algorithms, 1987
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Characterization and Recognition of Partial 3-TreesSIAM Journal on Algebraic Discrete Methods, 1986
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- Reduced State Enumeration?Another Algorithm for Reliability EvaluationIEEE Transactions on Reliability, 1978
- Computing the Reliability of Complex NetworksSIAM Journal on Applied Mathematics, 1977