Maximum Edge-Disjoint Paths Problem in Planar Graphs

DOI10.1007/978-3-540-72504-6_51zbMath1200.05234OpenAlexW1608666918MaRDI QIDQ5425468

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

determinant\#P-hardmaximum edge-disjoint paths

Mathematics Subject Classification ID

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

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