Maximum Edge-Disjoint Paths Problem in Planar Graphs

DOI10.1007/978-3-540-72504-6_51MaRDI QIDQ5425468zbMATH OpenOpenAlexFDO

Authors Mingji Xia

Publication date 13 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72504-6_51

zbMATH Keywords

\#P-harddeterminantmaximum edge-disjoint paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Recommendations

• Maximum edge-disjoint paths in planar graphs with congestion 2
• Edge-disjoint paths in planar graphs
• scientific article; zbMATH DE number 833804
• A linear-time algorithm for edge-disjoint paths in planar graphs
• On the complexity of the disjoint paths problem

Cited in

(7)

• Maximum graphs not spannable by \(r\) disjoint paths
• Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid
• Maximum edge-disjoint paths in planar graphs with congestion 2
• On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary
• The Maximum Disjoint Routing Problem
• The Vertex-Disjoint Menger Problem in Planar Graphs
• Induced disjoint paths problem in a planar digraph

This page was built for publication: Maximum Edge-Disjoint Paths Problem in Planar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425468)