Pages that link to "Item:Q4571992"
From MaRDI portal
The following pages link to Constructive linear time algorithms for branchwidth (Q4571992):
Displaying 30 items.
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
- Testing branch-width (Q875941) (← links)
- Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
- Branchwidth of chordal graphs (Q967314) (← links)
- Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
- Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
- Computing the branchwidth of interval graphs (Q1764810) (← links)
- FPT algorithms to enumerate and count acyclic and totally cyclic orientations (Q2132402) (← links)
- An analysis of the parameterized complexity of periodic timetabling (Q2142676) (← links)
- Square roots of minor closed graph classes (Q2442205) (← links)
- Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
- Typical sequences revisited -- computing width parameters of graphs (Q2701067) (← links)
- (Q2857427) (← links)
- An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances (Q2980924) (← links)
- A Local Search Algorithm for Branchwidth (Q3075536) (← links)
- Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339) (← links)
- Branch decompositions and minor containment (Q4446913) (← links)
- Graphs, branchwidth, and tangles! Oh my! (Q4667714) (← links)
- Finding branch-decompositions of matroids, hypergraphs, and more (Q5002759) (← links)
- Finding Branch-Decompositions of Matroids, Hypergraphs, and More (Q5013567) (← links)
- Computing Tree Decompositions (Q5042458) (← links)
- A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
- (Q5089157) (← links)
- (Q5874536) (← links)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)
- Tangle bases: Revisited (Q6087071) (← links)
