GRAPH-COLORING USING EIGENVALUE DECOMPOSITION

被引：43

作者：

ASPVALL, B

GILBERT, JR

机构：

来源：

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1984年 / 5卷 / 04期

关键词：

D O I：

10.1137/0605051

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：526 / 538

页数：13

共 24 条

[1] AN ALGORITHM FOR PARTITIONING THE NODES OF A GRAPH [J].

BARNES, ER .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (04) :541-550

[2]

BARNES ER, 1982, IBM RC9511 RES REP

[3] NEW METHODS TO COLOR THE VERTICES OF A GRAPH [J].

BRELAZ, D .

COLEMAN, TF ;

MORE, JJ .

[5]

Cvetkovic D., 1980, SPECTRA GRAPHS THEOR

[6] ROTATION OF EIGENVECTORS BY A PERTURBATION .3. [J].

DAVIS, C ;

KAHAN, WM .

[7]

Erds P, 1968, J COMB THEORY, V5, P164, DOI DOI 10.1016/S0021-9800(68)80051-1.

[8] COMPLEXITY OF NEAR-OPTIMAL GRAPH COLORING [J].

GAREY, MR ;

JOHNSON, DS .

[9]

George A., 1977, LECT NOTES MATH, V572, P52

[10]

Hoffman A, 1970, GRAPH THEORY ITS APP, P79