A BETTER THAN BEST POSSIBLE ALGORITHM TO EDGE COLOR MULTIGRAPHS

被引：31

作者：

HOCHBAUM, DS

NISHIZEKI, T

SHMOYS, DB

机构：

[1] UNIV CALIF BERKELEY,SCH BUSINESS ADM,BERKELEY,CA 94720

[2] TOHOKU UNIV,DEPT ELECT COMMUN,SENDAI,MIYAGI 980,JAPAN

[3] HARVARD UNIV,DIV APPL SCI,CAMBRIDGE,MA 02138

来源：

JOURNAL OF ALGORITHMS | 1986年 / 7卷 / 01期

关键词：

D O I：

10.1016/0196-6774(86)90039-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：79 / 104

页数：26

共 11 条

[1] ON EDGE COLORING BIPARTITE GRAPHS [J].

COLE, R ;

HOPCROFT, J .

SIAM JOURNAL ON COMPUTING, 1982, 11 (03) :540-546

[2]

Fiorini S., 1977, EDGE COLOURING GRAPH

[3] ALGORITHMS FOR EDGE COLORING BIPARTITE GRAPHS AND MULTIGRAPHS [J].

GABOW, HN ;

KARIV, O .

SIAM JOURNAL ON COMPUTING, 1982, 11 (01) :117-129

[4]

Garey MR., 1979, COMPUTERS INTRACTABI

[5]

GOLDBERG MK, UNPUB 15TH P SE C GR

[6]

GOLDBERG MK, 1984, J GRAPH THEOR, V8, P121

[7]

GONZALEZ T, 1976, J ACM, V23, P665, DOI 10.1145/321978.321985

[8]

Holyer IJ, 1980, SIAM J COMPUT, V10, P718

[9]

NISHIZEKI T, 1983, APPROXIMATION ALGORI

[10] A THEOREM ON COLORING THE LINES OF A NETWORK [J].

SHANNON, CE .

JOURNAL OF MATHEMATICS AND PHYSICS, 1949, 28 (02) :148-151

← 1 2 →