A linear-time algorithm for edge-disjoint paths in planar graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 432791 (Why is no real title available?)
- scientific article; zbMATH DE number 3314878 (Why is no real title available?)
- A class of algorithms which require nonlinear time to maintain disjoint sets
- A linear-time algorithm for a special case of disjoint set union
- Algorithms and computation. 4th international symposium, ISAAC '93, Hong Kong, December 15--17, 1993. Proceedings
- Algorithms for routing in planar graphs
- An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Faster shortest-path algorithms for planar graphs
- Maximum Flow in Planar Networks
- Multicommodity flows in planar graphs
- On multicommodity flows in planar graphs
- Routing through a generalized switchbox
Cited in
(35)- Non-crossing shortest paths in undirected unweighted planar graphs in linear time
- A linear time algorithm for finding three edge-disjoint paths in Eulerian networks
- scientific article; zbMATH DE number 3858436 (Why is no real title available?)
- A linear programming formulation of Mader's edge-disjoint paths problem
- Finding an Even Simple Path in a Directed Planar Graph
- On complexity, representation and approximation of integral multicommodity flows
- Edge-disjoint paths in planar graphs
- Euclidean maximum matchings in the plane -- local to global
- A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs
- scientific article; zbMATH DE number 2086258 (Why is no real title available?)
- LINEAR-TIME ALGORITHMS FOR DISJOINT TWO-FACE PATHS PROBLEMS IN PLANAR GRAPHS
- A near-linear-time algorithm for computing replacement paths in planar directed graphs
- scientific article; zbMATH DE number 2030041 (Why is no real title available?)
- 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
- A combinatorial algorithm for the planar multiflow problem with demands located on three holes
- Edge-disjoint paths in a grid bounded by two nested rectangles
- A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (extended abstract)
- Euclidean maximum matchings in the plane -- local to global
- The order-interval hypergraph of a finite poset and the König property
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
- scientific article; zbMATH DE number 780786 (Why is no real title available?)
- Online interval scheduling with predictions
- A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works
- scientific article; zbMATH DE number 833804 (Why is no real title available?)
- Improved approximation for node-disjoint paths in planar graphs
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
- An algorithm for node-capacitated ring routing
- scientific article; zbMATH DE number 475595 (Why is no real title available?)
- scientific article; zbMATH DE number 1555936 (Why is no real title available?)
- The edge-disjoint paths problem is NP-complete for series-parallel graphs
- Maximum Edge-Disjoint Paths Problem in Planar Graphs
- Paths of bounded length and their cuts: parameterized complexity and algorithms
- Paths of bounded length and their cuts: parameterized complexity and algorithms
- An exponential time parameterized algorithm for planar disjoint paths
- Edge-disjoint routing in plane switch graphs in linear time.
This page was built for publication: A linear-time algorithm for edge-disjoint paths in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1842575)
