Pages that link to "Item:Q2892258"

The following pages link to Planar branch decompositions. II: The cycle method (Q2892258):

Displaying 10 items.

• New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
• A combinatorial optimization algorithm for solving the branchwidth problem (Q429498) (← links)
• Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← 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)
• Planar branch decompositions. I: The ratcatcher (Q2892257) (← links)
• A Local Search Algorithm for Branchwidth (Q3075536) (← links)
• (Q4207784) (← links)