Tangle bases: Revisited
From MaRDI portal
Publication:6087071
DOI10.1002/net.21979zbMath1529.68212OpenAlexW3080079237MaRDI QIDQ6087071
Publication date: 11 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21979
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Dynamic programming (90C39) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- A combinatorial optimization algorithm for solving the branchwidth problem
- Satisfiability, branch-width and Tseitin tautologies
- Forbidden minors characterization of partial 3-trees
- Computing branchwidth via efficient triangulations and blocks
- Computing rank-width exactly
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Graph minors. X: Obstructions to tree-decomposition
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- 103 graphs that are irreducible for the projective plane
- All structured programs have small tree width and good register allocation
- Call routing and the ratcatcher
- On the excluded minors for the matroids of branch-width \(k\)
- Computing the branchwidth of interval graphs
- Graph minors. XIII: The disjoint paths problem
- Upper bounds to the clique width of graphs
- Tangle-tree duality: in graphs, matroids and beyond
- Rank-width: algorithmic and structural results
- Branch decomposition heuristics for linear matroids
- Approximating clique-width and branch-width
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The branchwidth of graphs and their cycle matroids
- Über eine Eigenschaft der ebenen Komplexe
- A SAT Approach to Branchwidth
- Tour Merging via Branch-Decomposition
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- Easy problems for tree-decomposable graphs
- A characterization of partial 3-trees
- The Branch-Width of Circular-Arc Graphs
- Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Exact Algorithms for Treewidth and Minimum Fill-In
- Complexity of Finding Embeddings in a k-Tree
- A kuratowski theorem for the projective plane
- Complexity Results for Bandwidth Minimization
- Graphs with Branchwidth at Most Three
- Branch decompositions and minor containment
- Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth
- Constructive linear time algorithms for branchwidth
- Graphs, branchwidth, and tangles! Oh my!
- Linear-time computation of optimal subgraphs of decomposable graphs
- Solving partial constraint satisfaction problems with tree decomposition
- Optimal branch-decomposition of planar graphs in O ( n 3 ) Time
- On Integer Programming and the Branch-Width of the Constraint Matrix
- Rank‐width is less than or equal to branch‐width
- Automata, Languages and Programming
- Algorithms – ESA 2005
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Automata, Languages and Programming
- Finding Branch-Decompositions and Rank-Decompositions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
