Improved self-reduction algorithms for graphs with bounded treewidth
- 17 October 1994
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 54 (2-3) , 101-115
- https://doi.org/10.1016/0166-218x(94)90018-3
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- An algebraic theory of graph reductionJournal of the ACM, 1993
- Finite automata, bounded treewidth and well-quasiorderingContemporary Mathematics, 1993
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph familiesAlgorithmica, 1992
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- 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
- Polynomial-time self-reducibility: theoretical motivations and practical results∗International Journal of Computer Mathematics, 1989
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- 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