Tree decompositions with small cost
DOI10.1016/J.DAM.2004.01.008zbMATH Open1084.05057OpenAlexW2047033531WikidataQ59567852 ScholiaQ59567852MaRDI QIDQ1764801FDOQ1764801
Authors: Hans L. Bodlaender, Fedor V. Fomin 
Publication date: 22 February 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/2577
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph Classes: A Survey
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A partial k-arboretum of graphs with bounded treewidth
- Complexity of Finding Embeddings in a k-Tree
- On rigid circuit graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Title not available (Why is that?)
- On the hardness of approximate reasoning
- Algorithmic Aspects of Vertex Elimination on Graphs
- Treewidth and minimum fill-in: Grouping the minimal separators
- A Linear Recognition Algorithm for Cographs
- The Pathwidth and Treewidth of Cographs
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Title not available (Why is that?)
- How to use the minimal separators of a graph for its chordal triangulation
- Memory requirements for table computations in partial \(k\)-tree algorithms
- Title not available (Why is that?)
- Tree-decompositions of small pathwidth
Cited In (16)
- Title not available (Why is that?)
- On tradeoffs between width- and fill-like graph parameters
- Uniform Constraint Satisfaction Problems and Database Theory
- Approximately counting locally-optimal structures
- A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs
- Minimum size tree-decompositions
- Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
- Tree decompositions of graphs: saving memory in dynamic programming
- Title not available (Why is that?)
- Seeing Arboretum for the (partial k-) Trees
- Tree Decompositions with Small Cost
- A faster tree-decomposition based algorithm for counting linear extensions
- A faster tree-decomposition based algorithm for counting linear extensions
- A revisit of the scheme for computing treewidth and minimum fill-in
- Minimum size tree-decompositions
- Approximately Counting Locally-Optimal Structures
This page was built for publication: Tree decompositions with small cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1764801)
