A LINEAR-TIME ALGORITHM FOR THE HOMOTOPIC ROUTING PROBLEM IN GRID GRAPHS

被引：5
|
作者：
KAUFMANN, M [1 ]
MEHLHORN, K [1 ]
机构：
[1] UNIV SAARLAND,MPI INFORMAT,D-66123 SAARBRUCKEN 11,GERMANY
来源：
SIAM JOURNAL ON COMPUTING | 1994年 / 23卷 / 02期
关键词：
ALGORITHMS; HOMOTOPIC ROUTING; EDGE-DISJOINT PATHS; VLSI-THEORY;
D O I：
10.1137/S0097539789162109
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The paper considers the problem of finding edge-disjoint paths between pairs of vertices in a finite grid graph. The homotopy class for each path to be routed is prespecified. A very fast algorithm that guarantees to find a solution for any solvable homotopic routing problem is given.
引用
收藏
页码：227 / 246
页数：20
相关论文
共 50 条
  • [31] A LINEAR-TIME RECOGNITION ALGORITHM FOR P-4-REDUCIBLE GRAPHS
    JAMISON, B
    OLARIU, S
    THEORETICAL COMPUTER SCIENCE, 1995, 145 (1-2) : 329 - 344
  • [32] A LINEAR-TIME ALGORITHM FOR EDGE-DISJOINT PATHS IN PLANAR GRAPHS
    WAGNER, D
    WEIHE, K
    COMBINATORICA, 1995, 15 (01) : 135 - 150
  • [33] A LINEAR-TIME RECOGNITION ALGORITHM FOR P-4-REDUCIBLE GRAPHS
    JAMISON, B
    OLARIU, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 405 : 1 - 19
  • [34] A linear-time algorithm for weighted paired-domination on block graphs
    Ching-Chi Lin
    Cheng-Yu Hsieh
    Ta-Yu Mu
    Journal of Combinatorial Optimization, 2022, 44 : 269 - 286
  • [35] A linear-time algorithm for weighted paired-domination on block graphs
    Lin, Ching-Chi
    Hsieh, Cheng-Yu
    Mu, Ta-Yu
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (01) : 269 - 286
  • [36] A Linear-Time Algorithm for Constructing a Spanning Tree on Circular Trapezoid Graphs
    Honma, Hirotoshi
    Nakajima, Yoko
    Aoshima, Haruka
    Masuyama, Shigeru
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2013, E96A (06): : 1051 - 1058
  • [37] A Linear-Time Algorithm for 2-Step Domination in Block Graphs
    Yancai ZHAO
    Lianying MIAO
    Zuhua LIAO
    JournalofMathematicalResearchwithApplications, 2015, 35 (03) : 285 - 290
  • [38] A SIMPLE LINEAR-TIME ALGORITHM FOR TRIANGULATING 3-COLORED GRAPHS
    BODLAENDER, H
    KLOKS, T
    JOURNAL OF ALGORITHMS, 1993, 15 (01) : 160 - 172
  • [39] A LINEAR-TIME ALGORITHM FOR MAXIMUM-CARDINALITY MATCHING ON COCOMPARABILITY GRAPHS
    Mertzios, George B.
    Nichterlein, Andre
    Niedermeier, Rolf
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (04) : 2820 - 2835
  • [40] A LINEAR-TIME RECOGNITION ALGORITHM FOR P-4-REDUCIBLE GRAPHS
    JAMISON, B
    OLARIU, S
    FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE ////, 1989, 405 : 1 - 19
12345