Easy problems for tree-decomposable graphs
- 1 June 1991
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 12 (2) , 308-340
- https://doi.org/10.1016/0196-6774(91)90006-k
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1987
- Linear-time computation of optimal subgraphs of decomposable graphsJournal of Algorithms, 1987
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 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
- Linear-time computability of combinatorial problems on series-parallel graphsJournal of the ACM, 1982
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- Generalized finite automata theory with an application to a decision problem of second-order logicTheory of Computing Systems, 1968