TY - GEN

T1 - Algorithms for finding non-crossing paths with minimum total length in plane graphs

AU - Takahashi, Jun Ya

AU - Suzuki, Hitoshi

AU - Nishizeki, Takao

N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1992.

PY - 1992

Y1 - 1992

N2 - Let G be an undirected plane graph with non-negative edge length, and let k terminal pairs lie on two specified face boundaries. This paper presents an algorithm for finding k “non-crossing paths” in G, each connecting a terminal pair, whose total length is minimum. Here “non-crossing paths” may share common vertices or edges but do not cross each other in the plane. The algorithm runs in time O(n log n) where n is the number of vertices in G.

AB - Let G be an undirected plane graph with non-negative edge length, and let k terminal pairs lie on two specified face boundaries. This paper presents an algorithm for finding k “non-crossing paths” in G, each connecting a terminal pair, whose total length is minimum. Here “non-crossing paths” may share common vertices or edges but do not cross each other in the plane. The algorithm runs in time O(n log n) where n is the number of vertices in G.

UR - http://www.scopus.com/inward/record.url?scp=84990196492&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84990196492&partnerID=8YFLogxK

U2 - 10.1007/3-540-56279-6_92

DO - 10.1007/3-540-56279-6_92

M3 - Conference contribution

AN - SCOPUS:84990196492

SN - 9783540562795

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 400

EP - 409

BT - Algorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings

A2 - Nishizeki, Takao

A2 - Ibaraki, Toshihide

A2 - Iwama, Kazuo

A2 - Yamashita, Masafurni

A2 - Inagaki, Yasuyoshi

PB - Springer Verlag

T2 - 3rd International Symposium on Algorithms and Computation, ISAAC 1992

Y2 - 16 December 1992 through 18 December 1992

ER -