A LINEAR ALGORITHM FOR FINDING A MINIMUM DOMINATING SET IN A CACTUS

被引：34

作者：

HEDETNIEMI, ST ^{[1
]}

LASKAR, R ^{[1
]}

PFAFF, J ^{[1
]}

机构：

[1] CLEMSON UNIV, DEPT MATH SCI, CLEMSON, SC 29631 USA

来源：

关键词：

* This research was partly supported by National Science Foundation Grants ISP-8011451 (EPSCOR) and MCS-8307832;

D O I：

10.1016/0166-218X(86)90089-2

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：287 / 292

页数：6

共 12 条

[1]

Ball, 1892, MATH RECREATIONS PRO

[2]

Berge C., 1973, GRAPHS HYPERGRAPHS, V7

[3] DOMINATING SETS IN CHORDAL GRAPHS [J].

BOOTH, KS ;

JOHNSON, JH .

[4]

Cockayne E., 1975, Information Processing Letters, V4, P41, DOI 10.1016/0020-0190(75)90011-3

[5]

Cockayne E. J., 1977, Networks, V7, P247, DOI 10.1002/net.3230070305

[6]

Cockayne E.J, 1978, LECT NOTES MATH, V642, P141, DOI DOI 10.1007/BFB0070371

FARBER, M .

[8]

Garey M. R., 1978, COMPUTERS INTRACTABI

[9]

LASKAR R, 1980, LECT NOTES MATH, V885, P308

[10] OPTIMUM DOMINATION IN WEIGHTED TREES [J].

NATARAJAN, KS ;

WHITE, LJ .