Shortest noncrossing paths in plane graphs

被引：13
|
作者：
Takahashi, JY [1 ]
Suzuki, H [1 ]
Nishizeki, T [1 ]
机构：
[1] TOHOKU UNIV, GRAD SCH INFORMAT SCI, SENDAI, MIYAGI 98077, JAPAN
来源：
ALGORITHMICA | 1996年 / 16卷 / 03期
关键词：
noncrossing paths; shortest path; plane graphs; single-layer routing; VLSI;
D O I：
10.1007/BF01955681
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Let G be an undirected plane graph with nonnegative edge length, and let k terminal pairs Lie on two specified face boundaries. This paper presents an algorithm for finding k ''noncrossing paths'' in G, each connecting a terminal pair, and whose total length is minimum. Noncrossing 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 and k is an arbitrary integer.
引用
收藏
页码：339 / 357
页数：19
相关论文
共 50 条
  • [21] Shortest paths in random weighted graphs
    Walley, SK
    Tan, HH
    COMPUTING AND COMBINATORICS, 1995, 959 : 213 - 222
  • [22] On Shortest Disjoint Paths in Planar Graphs
    Kobayashi, Yusuke
    Sommer, Christian
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 293 - +
  • [23] Fuzzy shortest paths in fuzzy graphs
    Baniamerian, Amir
    Menhaj, Mohammad Bagher
    COMPUTATIONAL INTELLIGENCE, THEORY AND APPLICATION, 2006, : 757 - 764
  • [24] SHORTEST PATHS ANONYMIZATION ON WEIGHTED GRAPHS
    Wang, Shyue-Liang
    Tsai, Yu-Chuan
    Kao, Hung-Yu
    Ting, I-Hsien
    Hong, Tzung-Pei
    INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING, 2013, 23 (01) : 65 - 79
  • [25] Rerouting shortest paths in planar graphs
    Bonsma, Paul
    DISCRETE APPLIED MATHEMATICS, 2017, 231 : 95 - 112
  • [26] ON GRAPHS COVERABLE BY k SHORTEST PATHS
    Dumas, Mael
    Foucaud, Florent
    Perez, Anthony
    Todinca, Ioan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2024, 38 (02) : 1840 - 1862
  • [27] Shortest paths in almost acyclic graphs
    Wagner, DK
    OPERATIONS RESEARCH LETTERS, 2000, 27 (04) : 143 - 147
  • [28] Shortest paths in fuzzy weighted graphs
    Cornelis, C
    De Kesel, P
    Kerre, EE
    INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2004, 19 (11) : 1051 - 1068
  • [29] Competition for Shortest Paths on Sparse Graphs
    Yeung, Chi Ho
    Saad, David
    PHYSICAL REVIEW LETTERS, 2012, 108 (20)
  • [30] On shortest disjoint paths in planar graphs
    Kobayashi, Yusuke
    Sommer, Christian
    DISCRETE OPTIMIZATION, 2010, 7 (04) : 234 - 245
12345