The following pages link to Planar Disjoint-Paths Completion (Q2891339):
Displaying 5 items.
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
- Tight Bounds for Linkages in Planar Graphs (Q3012796) (← links)
- A Polynomial-Time Algorithm for Outerplanar Diameter Improvement (Q3194712) (← links)
- (Q5091009) (← links)