Pages that link to "Item:Q553343"

The following pages link to Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343):

Displayed 5 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)
• Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) ‎ (← links)
• Improved bounds on the planar branchwidth with respect to the largest grid minor size (Q1934314) ‎ (← links)
• Approximation Algorithms for Euler Genus and Related Problems (Q4581910) ‎ (← links)