Pages that link to "Item:Q1730234"

The following pages link to Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234):

Displaying 9 items.

• Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
• New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
• Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
• Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
• Planar branch decompositions. II: The cycle method (Q2892258) (← links)
• (Q2945193) (redirect page) (← links)
• Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time (Q3652285) (← links)
• Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs (Q5233518) (← links)
• Automata, Languages and Programming (Q5716790) (← links)