Constructive linear time algorithms for branchwidth
From MaRDI portal
Recommendations
- From linear time to branching time
- Approximating optimum branchings in linear time
- scientific article; zbMATH DE number 1990711
- Branching and Treewidth Based Exact Algorithms
- Time-space trade-offs for branching programs
- Time-space tradeoffs for branching programs
- A SAT approach to branchwidth
- A SAT approach to branchwidth
- scientific article; zbMATH DE number 5899238
- Graph-Theoretic Concepts in Computer Science
Cites work
- A characterization of partial 3-trees
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Algorithms finding tree-decompositions of graphs
- An algebraic theory of graph reduction
- Call routing and the ratcatcher
- Characterization and Recognition of Partial 3-Trees
- Characterization of partial 3-trees in terms of three structures
- Complexity of Finding Embeddings in a k-Tree
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Forbidden minors characterization of partial 3-trees
- Graph minors. X: Obstructions to tree-decomposition
- scientific article; zbMATH DE number 3906520 (Why is no real title available?)
- scientific article; zbMATH DE number 176761 (Why is no real title available?)
- scientific article; zbMATH DE number 475614 (Why is no real title available?)
- scientific article; zbMATH DE number 1142299 (Why is no real title available?)
- On Linear Recognition of Tree-Width at Most Four
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- Steiner trees, partial 2–trees, and minimum IFI networks
- Treewidth and Pathwidth of Permutation Graphs
Cited in
(37)- Derivation of algorithms for cutwidth and related graph layout parameters
- Subexponential fixed-parameter algorithms for partial vector domination
- Computing the branchwidth of interval graphs
- FPT algorithms to enumerate and count acyclic and totally cyclic orientations
- An analysis of the parameterized complexity of periodic timetabling
- Square roots of minor closed graph classes
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Typical sequences revisited -- computing width parameters of graphs
- Square roots of minor closed graph classes
- (Total) vector domination for graphs with bounded branchwidth
- An upper bound for resolution size: characterization of tractable SAT instances
- A local search algorithm for branchwidth
- Subexponential fixed-parameter algorithms for partial vector domination
- Generation of Graphs with Bounded Branchwidth
- Graphs with Branchwidth at Most Three
- Branch decompositions and minor containment
- Subexponential parameterized algorithms
- Confronting intractability via parameters
- Graphs, branchwidth, and tangles! Oh my!
- Finding branch-decompositions of matroids, hypergraphs, and more
- Finding branch-decompositions of matroids, hypergraphs, and more
- Computing Tree Decompositions
- A linear fixed parameter tractable algorithm for connected pathwidth
- Parameterization of tensor network contraction
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time
- scientific article; zbMATH DE number 7651203 (Why is no real title available?)
- Edge-treewidth: algorithmic and combinatorial properties
- Fast FPT-approximation of branchwidth
- Tangle bases: Revisited
- Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width
- Fast FPT-approximation of branchwidth
- Temporal separators with deadlines
- Approximating branchwidth on parametric extensions of planarity
- Approximating branchwidth on parametric extensions of planarity
- Testing branch-width
- Practical algorithms for branch-decompositions of planar graphs
- Branchwidth of chordal graphs
This page was built for publication: Constructive linear time algorithms for branchwidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571992)
