Pages that link to "Item:Q2892257"
From MaRDI portal
The following pages link to Planar Branch Decompositions I: The Ratcatcher (Q2892257):
Displaying 10 items.
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Branch decomposition heuristics for linear matroids (Q2445840) (← links)
- A Local Search Algorithm for Branchwidth (Q3075536) (← links)
