Treewidth computation and extremal combinatorics
From MaRDI portal
Publication:2392037
Recommendations
Cites work
- scientific article; zbMATH DE number 5604103 (Why is no real title available?)
- scientific article; zbMATH DE number 5605070 (Why is no real title available?)
- scientific article; zbMATH DE number 1324671 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 1953201 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A Dynamic Programming Approach to Sequencing Problems
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A characterisation of rigid circuit graphs
- A machine program for theorem-proving
- A partial k-arboretum of graphs with bounded treewidth
- Automata, Languages and Programming
- Complexity of Finding Embeddings in a k-Tree
- Counting clique trees and computing perfect elimination schemes in parallel
- Exact Algorithms for Treewidth and Minimum Fill-In
- Exact exponential algorithms.
- Finding a Maximum Independent Set
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
- Graph minors. II. Algorithmic aspects of tree-width
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In
- Listing all Minimal Separators of a Graph
- Listing all potential maximal cliques of a graph
- On Exact Algorithms for Treewidth
- On generalized graphs
- On the Complexity of Computing Treelength
- On the Desirability of Acyclic Database Schemes
- STACS 2005
- The Travelling Salesman Problem in Bounded Degree Graphs
- The Use of Linear Graphs in Gauss Elimination
- Tree-decompositions with bags of small diameter
- Treewidth Computation and Extremal Combinatorics
- Treewidth and minimum fill-in: Grouping the minimal separators
- Trimmed Moebius inversion and graphs of bounded degree
Cited in
(28)- Positive-instance driven dynamic programming for treewidth
- Learning tractable Bayesian networks in the space of elimination orders
- On the number of minimal separators in graphs
- Path Contraction Faster Than 2^n
- Revisiting path contraction and cycle contraction
- A blossoming algorithm for tree volumes of composite digraphs
- Counting and Enumeration Problems with Bounded Treewidth
- Positive-instance driven dynamic programming for treewidth
- Approximately counting locally-optimal structures
- Path contraction faster than 2ⁿ
- Treewidth Computation and Extremal Combinatorics
- An FPT algorithm for elimination distance to bounded degree graphs
- Largest chordal and interval subgraphs faster than \(2^n\)
- Parameterized complexity of secluded connectivity problems
- FPT algorithms to compute the elimination distance to bipartite graphs and more
- Tractability of most probable explanations in multidimensional Bayesian network classifiers
- A fixed-parameter tractable algorithm for elimination distance to bounded degree graphs
- On the Number of Connected Sets in Bounded Degree Graphs
- Experimental Analysis of Treewidth
- The combinatorics of discrete time-trees: theory and open problems
- Revisiting path contraction and cycle contraction
- Computing tree-depth faster than \(2^n\)
- Deletion to scattered graph classes. I: Case of finite number of graph classes
- Finding connected secluded subgraphs
- Large Induced Subgraphs via Triangulations and CMSO
- A revisit of the scheme for computing treewidth and minimum fill-in
- Approximately Counting Locally-Optimal Structures
- A contraction-recursive algorithm for treewidth
This page was built for publication: Treewidth computation and extremal combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392037)
