Linear time algorithms for NP-hard problems restricted to partial k-trees
- 30 April 1989
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 23 (1), 11-24
- https://doi.org/10.1016/0166-218x(89)90031-0
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Tree-partite graphs and the complexity of algorithmsPublished by Springer Science and Business Media LLC ,2005
- A Dynamic Programming Approach to the Dominating Set Problem on k-TreesSIAM Journal on Algebraic Discrete Methods, 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
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- Linear-time computability of combinatorial problems on series-parallel graphsJournal of the ACM, 1982
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970