Abstract
We give a randomized algorithm for maximum edge-disjoint paths problem (MEDP) and the minimal total length of MEDP, if the graphs are planar and all terminals lie on the outer face in the order s1, s2, ... sk, tk, tk-1, ...t1. Moreover, if the degree of the graph is bounded by 3, the algorithm becomes deterministic and can also out-put the number of optimal solutions. On the other hand, we prove that the counting version of these problems are #P-hard even if restricted to planar graphs with maximum degree 3. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Xia, M. (2007). Maximum edge-disjoint paths problem in planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4484 LNCS, pp. 566–572). Springer Verlag. https://doi.org/10.1007/978-3-540-72504-6_51
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
