AN EFFICIENT ALGORITHM FOR FINDING MULTICOMMODITY FLOWS IN PLANAR NETWORKS

被引：25

作者：

MATSUMOTO, K

NISHIZEKI, T

SAITO, N

机构：

[1] Tohoku Univ, Dep of Electrical, Communications, Sendai, Jpn, Tohoku Univ, Dep of Electrical Communications, Sendai, Jpn

来源：

关键词：

D O I：

10.1137/0214023

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：289 / 302

页数：14

共 15 条

[1]

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

[2]

DIAZ H, 1972, CORE7212 CTR OP RES

[3]

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

[4]

Ford L.R., 1956, CAN J MATH, V8, P399, DOI [10.4153/CJM-1956-045-5, DOI 10.4153/CJM-1956-045-5]

[5]

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

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

HASSIN, R .

[7] 2-COMMODITY FLOW [J].

ITAI, A .

[8]

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

[9]

Khachian L. G., 1979, SOV MATH DOKL, V20, P191

[10] MULTICOMMODITY FLOWS IN PLANAR GRAPHS [J].

OKAMURA, H ;

SEYMOUR, PD .