Constructing Brambles
From MaRDI portal
Publication:3182927
DOI10.1007/978-3-642-03816-7_20zbMath1250.68213OpenAlexW2913393133MaRDI QIDQ3182927
Mathieu Chapelle, Ioan Todinca, Frédéric Mazoit
Publication date: 16 October 2009
Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_20
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Treewidth lower bounds with brambles
- An annotated bibliography on guaranteed graph searching
- Partitions versus sets: a case of duality
- On the maximum cardinality search lower bound for treewidth
- Nondeterministic graph searching: from pathwidth to treewidth
- Submodular partition functions
- Graph minors. X: Obstructions to tree-decomposition
- A partial k-arboretum of graphs with bounded treewidth
- Graph searching and a min-max theorem for tree-width
- Listing all potential maximal cliques of a graph
- On tree width, bramble size, and expansion
- Treewidth and Minimum Fill-in: Grouping the Minimal Separators
- Constructing Brambles
- The Branch-Width of Circular-Arc Graphs
- Exact Algorithms for Treewidth and Minimum Fill-In
- Complexity of Finding Embeddings in a k-Tree
- Contraction and Treewidth Lower Bounds
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Experimental and Efficient Algorithms
This page was built for publication: Constructing Brambles