LINEAR-TIME COMPUTATION OF OPTIMAL SUBGRAPHS OF DECOMPOSABLE GRAPHS

被引：123

作者：

BERN, MW ^{[1
]}

LAWLER, EL ^{[1
]}

WONG, AL ^{[1
]}

机构：

[1] UNIV CALIF BERKELEY,DIV COMP SCI,BERKELEY,CA 94720

来源：

JOURNAL OF ALGORITHMS | 1987年 / 8卷 / 02期

关键词：

D O I：

10.1016/0196-6774(87)90039-3

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：216 / 235

页数：20

共 23 条

[1]

BEYER T, 1977, 8TH P SE C COMB GRAP, P321

[2] GRAPH-THEORETIC PARAMETERS CONCERNING DOMINATION, INDEPENDENCE, AND IRREDUNDANCE [J].

BOLLOBAS, B ;

COCKAYNE, EJ .

JOURNAL OF GRAPH THEORY, 1979, 3 (03) :241-249

[3] THE IRREDUNDANCE NUMBER AND MAXIMUM DEGREE OF A GRAPH [J].

BOLLOBAS, B ;

COCKAYNE, EJ .

DISCRETE MATHEMATICS, 1984, 49 (02) :197-199

[4]

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

[5] CONTRIBUTIONS TO THE THEORY OF DOMINATION, INDEPENDENCE AND IRREDUNDANCE IN GRAPHS [J].

COCKAYNE, EJ ;

FAVARON, O ;

PAYAN, C ;

THOMASON, AG .

DISCRETE MATHEMATICS, 1981, 33 (03) :249-258

[6] HALIN GRAPHS AND THE TRAVELING SALESMAN PROBLEM [J].

CORNUEJOLS, G ;

NADDEF, D ;

PULLEYBLANK, WR .

MATHEMATICAL PROGRAMMING, 1983, 26 (03) :287-294

[7]

DAYKIN DE, 1966, J AUSTR MATH SOC, V6, P89

[8]

Goodman S., 1976, SIAM Journal on Computing, V5, P104, DOI 10.1137/0205009

[9]

Halin R., 1971, COMBINATORIAL MATH I, P129

[10]

HEDETNIEMI SM, 1985, GRAPH THEORY APPLICA

← 1 2 3 →