Pages that link to "Item:Q2583126"
From MaRDI portal
The following pages link to On the complexity of the planar directed edge-disjoint paths problem (Q2583126):
Displaying 13 items.
- On the complexity of the edge-disjoint min-min problem in planar digraphs (Q428855) (← links)
- The hardness of routing two pairs on one face (Q662307) (← links)
- On the complexity of vertex-disjoint length-restricted path problems (Q1762664) (← links)
- Eulerian disjoint paths problem in grid graphs is NP-complete (Q1887070) (← links)
- NP-completeness of some edge-disjoint paths problems (Q1897369) (← links)
- On structural parameterizations of the edge disjoint paths problem (Q2032342) (← links)
- On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary (Q2149491) (← links)
- On the complexity of the disjoint paths problem (Q2367446) (← links)
- Multiflow Feasibility: An Annotated Tableau (Q2971612) (← links)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- (Q5136255) (← links)
- An exponential time parameterized algorithm for planar disjoint paths (Q5145014) (← links)
- Algorithms - ESA 2003 (Q5897270) (← links)