Safe separators for treewidth
From MaRDI portal
Publication:819825
DOI10.1016/j.disc.2005.12.017zbMath1084.05065WikidataQ59567815 ScholiaQ59567815MaRDI QIDQ819825
Hans L. Bodlaender, Arie M. C. A. Koster
Publication date: 29 March 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/22166
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone, Minimal triangulations of graphs: a survey, Safe separators for treewidth, Treewidth lower bounds with brambles, On the maximum cardinality search lower bound for treewidth, Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions, Bounded treewidth as a key to tractability of knowledge representation and reasoning, Tree decomposition and discrete optimization problems: a survey, Characterizing and Computing Minimal Cograph Completions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monadic second-order evaluations on tree-decomposable graphs
- Improved algorithms for graph four-connectivity
- Safe separators for treewidth
- Decomposition by clique separators
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- A partial k-arboretum of graphs with bounded treewidth
- A practical algorithm for making filled graphs minimal
- Optimal decomposition by clique separators
- Easy problems for tree-decomposable graphs
- Algorithms for Radio Link Frequency Assignment: The Calma Project
- Characterization and Recognition of Partial 3-Trees
- Complexity of Finding Embeddings in a k-Tree
- Dividing a Graph into Triconnected Components
- Solving partial constraint satisfaction problems with tree decomposition
- Depth-First Search and Linear Graph Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
