ALGORITHMS FOR EDGE COLORING BIPARTITE GRAPHS AND MULTIGRAPHS

被引:79
作者
GABOW, HN [1 ]
KARIV, O [1 ]
机构
[1] TECHNION ISRAEL INST TECHNOL,DEPT COMP SCI,HAIFA,ISRAEL
关键词
D O I
10.1137/0211009
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:117 / 129
页数:13
相关论文
共 13 条
[11]   PREEMPTIVE SCHEDULING OF UNRELATED PARALLEL PROCESSORS BY LINEAR-PROGRAMMING [J].
LAWLER, EL ;
LABETOULLE, J .
JOURNAL OF THE ACM, 1978, 25 (04) :612-619
[12]   A FAST PARALLEL ALGORITHM FOR ROUTING IN PERMUTATION NETWORKS [J].
LEV, GF ;
PIPPENGER, N ;
VALIANT, LG .
IEEE TRANSACTIONS ON COMPUTERS, 1981, 30 (02) :93-100
[13]  
Ore O., 1962, AMS C PUBLICATIONS, V38, P1962