Treewidth computations. II. Lower bounds
From MaRDI portal
Publication:549673
Recommendations
Cites work
- scientific article; zbMATH DE number 1057879 (Why is no real title available?)
- 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 New Lower Bound for Tree-Width Using Maximum Cardinality Search
- A combinatorial optimization algorithm for solving the branchwidth problem
- A partial k-arboretum of graphs with bounded treewidth
- A spectral lower bound for the treewidth of a graph and its consequences
- Algorithms – ESA 2004
- Boxicity and treewidth
- Call routing and the ratcatcher
- Characterization and Recognition of Partial 3-Trees
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Constant-degree graph expansions that preserve treewidth
- Contraction and Treewidth Lower Bounds
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Experimental and Efficient Algorithms
- Girth and treewidth
- Graph minors. II. Algorithmic aspects of tree-width
- Graph theory
- Necessary edges in \(k\)-chordalisations of graphs
- Network flows. Theory, algorithms, and applications.
- On Exact Algorithms for Treewidth
- On the maximum cardinality search lower bound for treewidth
- Planar branch decompositions. I: The ratcatcher
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- The Structure and Number of Obstructions to Treewidth
- Treewidth and Pathwidth of Permutation Graphs
- Treewidth computations. I: Upper bounds
- Treewidth lower bounds with brambles
Cited in
(44)- Treewidth distance on phylogenetic trees
- Treewidth of display graphs: bounds, brambles and applications
- Treewidth and the Computational Complexity of MAP Approximations
- Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
- Courcelle's theorem -- a game-theoretic approach
- scientific article; zbMATH DE number 7764121 (Why is no real title available?)
- Contraction and Treewidth Lower Bounds
- Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width
- A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
- A lower bound for treewidth and its consequences
- On the maximum cardinality search lower bound for treewidth
- A combinatorial Li-Yau inequality and rational points on curves
- A New Lower Bound for Tree-Width Using Maximum Cardinality Search
- Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs
- Treewidth computations. I: Upper bounds
- Algorithms – ESA 2004
- Treewidth versus clique number. II: Tree-independence number
- Finding good decompositions for dynamic programming on dense graphs
- Adiabatic quantum programming: minor embedding with hard faults
- Graphs of gonality three
- Minimum size tree-decompositions
- Algorithms – ESA 2005
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- Maintaining range trees is secondary memory. Part II: Lower bounds
- scientific article; zbMATH DE number 1982177 (Why is no real title available?)
- Recognizing hyperelliptic graphs in polynomial time
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- Locating Eigenvalues of Symmetric Matrices - A Survey
- A managed Bayesian risk approach for decision making alternatives
- A lower bound for tree resolution
- Experimental and Efficient Algorithms
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions
- An Experimental Study of the Treewidth of Real-World Graph Data
- Fixed-parameter tractability of treewidth and pathwidth
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- scientific article; zbMATH DE number 3864518 (Why is no real title available?)
- A sequential reduction method for inference in generalized linear mixed models
- Computing treewidth on the GPU
- On making a distinguished vertex of minimum degree by vertex deletion
- Treewidth versus clique number. I: Graph classes with a forbidden structure
- Lower Bounds for QBFs of Bounded Treewidth
- Treewidth lower bounds with brambles
- An improved spectral lower bound of treewidth
- Computational aspects of treewidth for graph
This page was built for publication: Treewidth computations. II. Lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549673)
