Pages that link to "Item:Q287243"
From MaRDI portal
The following pages link to A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs (Q287243):
Displaying 5 items.
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
- A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (extended abstract) (Q826071) (← links)
- A linear-time algorithm for edge-disjoint paths in planar graphs (Q1842575) (← links)
- Edge-Disjoint (s,t)-Paths in Undirected Planar Graphs in Linear Time (Q3128989) (← links)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)