Safe Reduction Rules for Weighted Treewidth
Open Access
- 24 January 2007
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 47 (2) , 139-158
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Solving partial constraint satisfaction problems with tree decompositionNetworks, 2002
- Reduction Algorithms for Graphs of Small TreewidthInformation and Computation, 2001
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- The nonexistence of reduction rules giving an embedding into a k-treeDiscrete Applied Mathematics, 1994
- The Pathwidth and Treewidth of CographsSIAM Journal on Discrete Mathematics, 1993
- Algorithms finding tree-decompositions of graphsJournal of Algorithms, 1991
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- Local Computations with Probabilities on Graphical Structures and Their Application to Expert SystemsJournal of the Royal Statistical Society Series B: Statistical Methodology, 1988
- 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