Pages that link to "Item:Q1842575"
From MaRDI portal
The following pages link to A linear-time algorithm for edge-disjoint paths in planar graphs (Q1842575):
Displaying 12 items.
- Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
- Euclidean maximum matchings in the plane -- local to global (Q832859) (← links)
- A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works (Q1304467) (← links)
- The order-interval hypergraph of a finite poset and the König property (Q1363653) (← links)
- Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph (Q1959418) (← links)
- On complexity, representation and approximation of integral multicommodity flows (Q1962043) (← links)
- Non-crossing shortest paths in undirected unweighted planar graphs in linear time (Q2097216) (← links)
- An algorithm for node-capacitated ring routing (Q2467482) (← links)
- A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes (Q3194707) (← links)
- Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms (Q3656863) (← links)
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time (Q5886044) (← links)
- The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246) (← links)
