A LINEAR ALGORITHM FOR THE DOMINATION NUMBER OF A SERIES-PARALLEL GRAPH

被引：53

作者：

KIKUNO, T

YOSHIDA, N

KAKUDA, Y

机构：

来源：

关键词：

D O I：

10.1016/0166-218X(83)90003-3

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：299 / 311

页数：13

共 10 条

[1]

ADAM A, 1968, TRUTH FUNCTIONS PROB, P145

[2]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[3]

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

[4]

Garey M. R., 1976, Theoretical Computer Science, V1, P237, DOI 10.1016/0304-3975(76)90059-1

[5]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[6]

Hopcroft J. E., 1973, SIAM Journal on Computing, V2, P135, DOI 10.1137/0202012

[7]

IBARAKI T, 1979, COMPLEXITY P CTR PRO

[8] ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS .1. P-CENTERS [J].

KARIV, O ;

HAKIMI, SL .

[9]

KIKUNO T, 1980, T IECE JAPAN E, V64, P443

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

NATARAJAN, KS ;

WHITE, LJ .