Constructing Brambles

DOI10.1007/978-3-642-03816-7_20MaRDI QIDQ3182927zbMATH OpenOpenAlexFDO

Authors Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Recommendations

• Constant Congestion Brambles
• On tree width, bramble size, and expansion
• Treewidth lower bounds with brambles
• Algorithms – ESA 2005
• Directed Nowhere Dense Classes of Graphs

Cites work

• scientific article; zbMATH DE number 1982177 (Why is no real title available?)
• scientific article; zbMATH DE number 1870231 (Why is no real title available?)
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• A partial k-arboretum of graphs with bounded treewidth
• An annotated bibliography on guaranteed graph searching
• Complexity of Finding Embeddings in a k-Tree
• Constructing Brambles
• Contraction and Treewidth Lower Bounds
• Exact Algorithms for Treewidth and Minimum Fill-In
• Experimental and Efficient Algorithms
• Graph minors. X: Obstructions to tree-decomposition
• Graph searching and a min-max theorem for tree-width
• Listing all potential maximal cliques of a graph
• Nondeterministic graph searching: from pathwidth to treewidth
• On the maximum cardinality search lower bound for treewidth
• On tree width, bramble size, and expansion
• Partitions versus sets: a case of duality
• Submodular partition functions
• The Branch-Width of Circular-Arc Graphs
• Treewidth and minimum fill-in: Grouping the minimal separators
• Treewidth lower bounds with brambles

Cited in

(5)

• Treewidth lower bounds with brambles
• Constant Congestion Brambles
• On tree width, bramble size, and expansion
• On strict brambles
• Constructing Brambles

This page was built for publication: Constructing Brambles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3182927)