Maximum edge-disjoint paths problem in planar graphs

Authors:
Mingji Xia
Affiliations:
State Key Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China and Graduate University of Chinese Academy of Sciences, Beijing, China
Venue:
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Year:
2007

Citing 6
Cited 0

Integer plane multiflows with a fixed number of demands

Journal of Combinatorial Theory Series B
The Complexity of Counting in Sparse, Regular, and Planar Graphs

SIAM Journal on Computing
Quantum Circuits That Can Be Simulated Classically in Polynomial Time

SIAM Journal on Computing
Holographic Algorithms (Extended Abstract)

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Accidental Algorthims

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
#3-Regular bipartite planar vertex cover is #p-complete

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.00

Visualization

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 output 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.