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

Jun Ya Takahashi, Hitoshi Suzuki, Takao Nishizeki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings
EditorsTakao Nishizeki, Toshihide Ibaraki, Kazuo Iwama, Masafurni Yamashita, Yasuyoshi Inagaki
PublisherSpringer Verlag
Pages400-409
Number of pages10
ISBN (Print)9783540562795
DOIs
Publication statusPublished - 1992
Event3rd International Symposium on Algorithms and Computation, ISAAC 1992 - Nagoya, Japan
Duration: 1992 Dec 161992 Dec 18

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume650 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd International Symposium on Algorithms and Computation, ISAAC 1992
CountryJapan
CityNagoya
Period92/12/1692/12/18

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Algorithms for finding non-crossing paths with minimum total length in plane graphs'. Together they form a unique fingerprint.

Cite this