Pages that link to "Item:Q5002709"
From MaRDI portal
The following pages link to Improved approximation for node-disjoint paths in grids with sources on the boundary (Q5002709):
Displaying 6 items.
- A tight lower bound for edge-disjoint paths on planar DAGs (Q2692724) (← links)
- New hardness results for routing on disjoint paths (Q4977963) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments (Q5054766) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs (Q6158361) (← links)