A QUICK METHOD FOR FINDING SHORTEST PAIRS OF DISJOINT PATHS

被引：480

作者：

SUURBALLE, JW ^{[1
]}

TARJAN, RE ^{[1
]}

机构：

[1] BELL TEL LABS INC,MURRAY HILL,NJ 07974

来源：

关键词：

D O I：

10.1002/net.3230140209

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：325 / 336

页数：12

共 10 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390

[3] THE DIRECTED SUBGRAPH HOMEOMORPHISM PROBLEM [J].

FORTUNE, S ;

HOPCROFT, J ;

WYLLIE, J .

[4]

Johnson D. B., 1975, Information Processing Letters, V4, P53, DOI 10.1016/0020-0190(75)90001-0

[5] EFFICIENT ALGORITHMS FOR SHORTEST PATHS IN SPARSE NETWORKS [J].

JOHNSON, DB .

[6]

Lawler E.L., 1976, COMBINATORIAL OPTIMI

[7]

Suurballe J. W., 1974, Networks, V4, P125, DOI 10.1002/net.3230040204

[8]

SUURBALLE JW, 1982, UNPUB SINGLE SOURCE

[9]

Tarjan R., 1974, SIAM Journal on Computing, V3, P62, DOI 10.1137/0203006

[10]

Tarjan Robert Endre, 1983, ALGORITHMS, V44