PARALLEL ALGORITHMS FOR MINIMUM CUTS AND MAXIMUM FLOWS IN PLANAR NETWORKS

被引：22

作者：

JOHNSON, DB

机构：

来源：

关键词：

D O I：

10.1145/31846.31849

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：950 / 967

页数：18

共 19 条

[1]

Ford LR., 1956, CAN J MATH, V8, P399, DOI DOI 10.4153/CJM-1956-045-5

[2]

Frederickson G. N., 1983, 24th Annual Symposium on Foundations of Computer Science, P242, DOI 10.1109/SFCS.1983.69

[3]

Galil Z., 1978, 19th Annual Symposium on Foundations of Computer Science, P231, DOI 10.1109/SFCS.1978.5

[4] THE MAXIMUM FLOW PROBLEM IS LOG SPACE COMPLETE FOR P [J].

GOLDSCHLAGER, LM ;

SHAW, RA ;

STAPLES, J .

[5]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.1201/9780429493768

HASSIN, R ;

JOHNSON, DB .

[7] MAXIMUM FLOW IN (S,T) PLANAR NETWORKS [J].

HASSIN, R .

[8]

Itai A., 1979, SIAM Journal on Computing, V8, P135, DOI 10.1137/0208012

JANIGA, L ;

KOUBEK, V .

[10]

Johnson D. B., 1982, 20TH P ANN ALL C COM, P898