Pages that link to "Item:Q2149491"
From MaRDI portal
The following pages link to On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary (Q2149491):
Displaying 6 items.
- The hardness of routing two pairs on one face (Q662307) (← links)
- Multiflows in symmetric digraphs (Q713317) (← links)
- Linkage on the infinite grid (Q1641161) (← links)
- NP-completeness of some edge-disjoint paths problems (Q1897369) (← links)
- On the complexity of the planar directed edge-disjoint paths problem (Q2583126) (← links)
- (Q5090955) (← links)