OPTIMAL APPROXIMATION OF SPARSE HESSIANS AND ITS EQUIVALENCE TO A GRAPH-COLORING PROBLEM

被引：85

作者：

MCCORMICK, ST

机构：

来源：

关键词：

D O I：

10.1007/BF02592052

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：153 / 171

页数：19

共 9 条

[1]

BONDY JA, 1976, GRAPH THEORY APPLICA

[2]

COLEMAN TF, 1981, ANL8139 TECHN REP

[3]

Curtis A. R., 1974, Journal of the Institute of Mathematics and Its Applications, V13, P117

[4]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[5] COLORING RANDOM GRAPHS [J].

GRIMMETT, GR ;

MCDIARMID, CJH .

[6]

JOHNSON DS, 1974, 5TH P SE C COMB GRAP, P513

[7]

Karp R.M., 1972, COMPLEXITY COMPUTER

[8] ESTIMATION OF SPARSE HESSIAN MATRICES [J].

POWELL, MJD ;

TOINT, PL .

[9]

THAPA M, 1980, THESIS STANFORD U ST