AN ALGORITHM FOR PARTITIONING THE NODES OF A GRAPH

被引:169
作者
BARNES, ER
机构
来源
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1982年 / 3卷 / 04期
关键词
D O I
10.1137/0603056
中图分类号
O29 [应用数学];
学科分类号
070104 [应用数学];
摘要
引用
收藏
页码:541 / 550
页数:10
相关论文
共 12 条
[1]
CHARNEY HR, 1968, JUL SHAR ACM IEEE DE
[2]
COMEAU LW, 1967, OCT ACM S OP SYST PR
[3]
CULLUM J. K., 1974, 1974 P IEEE C DEC CO, P505
[4]
DENNING PJ, 1970, COMPUT SURV, V2, P153
[5]
LOWER BOUNDS FOR PARTITIONING OF GRAPHS [J].
DONATH, WE ;
HOFFMAN, AJ .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1973, 17 (05) :420-425
[6]
FRIEDMAN AD, 1975, THEORY DESIGN SWITCH
[7]
Hadley G., 1962, LINEAR PROGRAMMING
[8]
THE VARIATION OF THE SPECTRUM OF A NORMAL MATRIX [J].
HOFFMAN, AJ ;
WIELANDT, HW .
DUKE MATHEMATICAL JOURNAL, 1953, 20 (01) :37-39
[9]
KERNIGHAN B, 1969, THESIS PRINCETON U P
[10]
Kernighan B. W., 1970, Bell System Technical Journal, V49, P291