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 4 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)
• (Q2945193) (redirect page) (← links)