LOWER BOUNDS FOR PARTITIONING OF GRAPHS

被引：356

作者：

DONATH, WE ^{[1
]}

HOFFMAN, AJ ^{[1
]}

机构：

[1] IBM CORP, THOMAS J WATSON RES CTR, YORKTOWN HTS, NY 10598 USA

来源：

关键词：

D O I：

10.1147/rd.175.0420

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：420 / 425

页数：6

共 9 条

[1]

CHARNEY HR, 1968, EFFICIENT PARTITIONI

[2]

COMEAU LW, 1967, OCT ACM S OP SYST PR

[3]

DENNING PJ, 1970, COMPUT SURV, V2, P153

FAN, K .

[5] R-DIMENSIONAL QUADRATIC PLACEMENT ALGORITHM [J].

HALL, KM .

MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 17 (03) :219-229

[6] THE VARIATION OF THE SPECTRUM OF A NORMAL MATRIX [J].

HOFFMAN, AJ ;

WIELANDT, HW .

[7]

MARCUS M, 1964, SURVEY MATRIX THEORY, pCH2

[8]

RUSSO RL, TO BE PUBLISHED

ZAHN, CT .