EFFICIENT MESSAGE ROUTING IN PLANAR NETWORKS

被引:44
作者
FREDERICKSON, GN [1 ]
JANARDAN, R [1 ]
机构
[1] UNIV MINNESOTA,DEPT COMP SCI,MINNEAPOLIS,MN 55455
关键词
D O I
10.1137/0218058
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:843 / 857
页数:15
相关论文
共 14 条
[1]  
Baker B. S., 1983, 24th Annual Symposium on Foundations of Computer Science, P265, DOI 10.1109/SFCS.1983.7
[2]  
BONDY JA, 1976, GRAPH THEORY APPLICA
[3]   TOPOLOGY OF SERIES-PARALLEL NETWORKS [J].
DUFFIN, RJ .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1965, 10 (02) :303-&
[4]   DESIGNING NETWORKS WITH COMPACT ROUTING TABLES [J].
FREDERICKSON, GN ;
JANARDAN, R .
ALGORITHMICA, 1988, 3 (01) :171-190
[5]  
FREDERICKSON GN, 1987, SIAM J COMPUT, V16, P1004, DOI 10.1137/0216064
[6]  
FREDERICKSON GN, IN PRESS SIAM J COMP, V19
[7]  
Harary F., 1969, GRAPH THEORY, DOI DOI 10.1201/9780429493768
[8]  
Kleinrock L., 1977, Computer Networks, V1, P155, DOI 10.1016/0376-5075(77)90002-2
[9]   APPLICATIONS OF A PLANAR SEPARATOR THEOREM [J].
LIPTON, RJ ;
TARJAN, RE .
SIAM JOURNAL ON COMPUTING, 1980, 9 (03) :615-627