MINIMUM S-T CUT OF A PLANAR UNDIRECTED NETWORK IN O(N LOG2 (N)) TIME

被引:60
作者
REIF, JH
机构
关键词
D O I
10.1137/0212005
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:71 / 81
页数:11
相关论文
共 13 条
[1]  
Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2]  
BOAS PV, 1977, MATH SYST THEORY, V10, P99
[3]  
CHESTON G, 1977, FAST ALGORITHMS DETE
[4]  
Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390
[5]  
Even S., 1975, SIAM Journal on Computing, V4, P507, DOI 10.1137/0204043
[6]  
FORD C, 1956, CANAD J MATH, V8, P399
[7]  
Ford C., 1962, FLOWS NETWORKS
[8]  
GALIL Z, 1979, P S THEORY COMPUTING
[9]  
Itai A., 1979, SIAM Journal on Computing, V8, P135, DOI 10.1137/0208012
[10]  
SHILOACH Y, 1978, ONILOG2I MAXIMUM FLO