Pages that link to "Item:Q926284"
From MaRDI portal
The following pages link to Treewidth lower bounds with brambles (Q926284):
Displaying 17 items.
- Tree-width of hypergraphs and surface duality (Q414640) (← links)
- A note on planar graphs with large width parameters and small grid-minors (Q423947) (← links)
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Lower bounds for treewidth of product graphs (Q741743) (← links)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
- A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Improved bounds on the planar branchwidth with respect to the largest grid minor size (Q1934314) (← links)
- On planar graphs with large tree-width and small grid minors (Q2839208) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)
- Constructing Brambles (Q3182927) (← links)
- Encoding Treewidth into SAT (Q3637156) (← links)
- Treewidth of Cartesian Products of Highly Connected Graphs (Q5325943) (← links)
- Fission: Practical algorithms for computing minimum balanced node separators (Q6115756) (← links)
