LINEAR TIME ALGORITHMS FOR NP-HARD PROBLEMS RESTRICTED TO PARTIAL K-TREES

被引：347

作者：

ARNBORG, S ^{[1
]}

PROSKUROWSKI, A ^{[1
]}

机构：

[1] UNIV OREGON,DEPT COMP & INFORMAT SCI,EUGENE,OR 97403

来源：

DISCRETE APPLIED MATHEMATICS | 1989年 / 23卷 / 01期

关键词：

D O I：

10.1016/0166-218X(89)90031-0

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：11 / 24

页数：14

共 21 条

[1] REDUCED STATE ENUMERATION - ANOTHER ALGORITHM FOR RELIABILITY EVALUATION [J].

ARNBORG, S .

IEEE TRANSACTIONS ON RELIABILITY, 1978, 27 (02) :101-105

[2] CHARACTERIZATION AND RECOGNITION OF PARTIAL 3-TREES [J].

ARNBORG, S ;

PROSKUROWSKI, A .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1986, 7 (02) :305-314

[3]

ARNBORG S, 1985, BIT, V25, P2, DOI 10.1007/BF01934985

[4] COMPLEXITY OF FINDING EMBEDDINGS IN A K-TREE [J].

ARNBORG, S ;

CORNEIL, DG ;

PROSKUROWSKI, A .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1987, 8 (02) :277-284

[5] LINEAR-TIME COMPUTATION OF OPTIMAL SUBGRAPHS OF DECOMPOSABLE GRAPHS [J].

BERN, MW ;

LAWLER, EL ;

WONG, AL .

JOURNAL OF ALGORITHMS, 1987, 8 (02) :216-235

[6]

Bertele Umberto, 1972, NONSERIAL DYNAMIC PR

[7] COMPLEMENT REDUCIBLE GRAPHS [J].

CORNEIL, DG ;

LERCHS, H ;

BURLINGHAM, LS .

DISCRETE APPLIED MATHEMATICS, 1981, 3 (03) :163-174

[8] A DYNAMIC-PROGRAMMING APPROACH TO THE DOMINATING SET PROBLEM ON KAPPA-TREES [J].

CORNEIL, DG ;

KEIL, JM .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1987, 8 (04) :535-543

[9]

Garey M. R., 1979, COMPUTERS INTRACTABI

[10]

Gavril F., 1972, SIAM Journal on Computing, V1, P180, DOI 10.1137/0201013

← 1 2 3 →