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
关键词
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 条