On the Maximum Cardinality Search Lower Bound for Treewidth
- 1 January 2004
- book chapter
- Published by Springer Nature
- p. 81-92
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Contraction and Treewidth Lower BoundsLecture Notes in Computer Science, 2004
- New Lower and Upper Bounds for Graph TreewidthLecture Notes in Computer Science, 2003
- A New Lower Bound for Tree-Width Using Maximum Cardinality SearchSIAM Journal on Discrete Mathematics, 2003
- Solving partial constraint satisfaction problems with tree decompositionNetworks, 2002
- Safe Reduction Rules for Weighted TreewidthLecture Notes in Computer Science, 2002
- The Structure and Number of Obstructions to TreewidthSIAM Journal on Discrete Mathematics, 1997
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- Local Computations with Probabilities on Graphical Structures and Their Application to Expert SystemsJournal of the Royal Statistical Society Series B: Statistical Methodology, 1988
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic HypergraphsSIAM Journal on Computing, 1984
- An inequality for the chromatic number of a graphJournal of Combinatorial Theory, 1968