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 ;
摘要
15
引用
收藏
页码:289 / 302
页数:14
相关论文
共 15 条
[11]  
SAKAROVITCH M, 1966, THESIS U CALIFORNIA
[12]  
SAKAROVITCH M, 1973, MATH PROGRAM, V4, P1
[13]  
SLEATOR D, 1980, THESIS STANFORD U ST
[14]   A DATA STRUCTURE FOR DYNAMIC TREES [J].
SLEATOR, DD ;
TARJAN, RE .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1983, 26 (03) :362-391
[15]   BI-PATH NETWORKS + MULTICOMMODITY FLOWS [J].
TANG, DT .
IEEE TRANSACTIONS ON CIRCUIT THEORY, 1964, CT11 (04) :468-&