EFFICIENT ALGORITHMS FOR COMBINATORIAL PROBLEMS ON GRAPHS WITH BOUNDED DECOMPOSABILITY - A SURVEY

被引：8

作者：

ARNBORG, S ^{[1
]}

机构：

[1] ROYAL INST TECHNOL,DEPT NUMER ANAL & COMP SCI,S-10044 STOCKHOLM 70,SWEDEN

来源：

BIT | 1985年 / 25卷 / 01期

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 [计算机软件与理论]; 0835 [软件工程];

摘要：

引用

页码：2 / 23

页数：22

共 33 条

[1]

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

[2]

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

ARNBORG, S .

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

[3]

ARNBORG S, 1979, FOA C20292D8 NAT DEF

[4]

Arnborg S, 1984, TRITANA8404 ROYAL I

[5]

ARNBORG S, 1984, TRITANA8402 ROYAL I

[6]

ARNBORG S, 1984, TRITANA8407 ROYAL I

[7]

PROPERTIES AND CHARACTERIZATIONS OF K-TREES [J].

BEINEKE, LW ;

PIPPERT, RE .

MATHEMATIKA, 1971, 18 (35) :141-&

[8]

Bertele Umberto, 1972, NONSERIAL DYNAMIC PR

[9]

COLBOURN CJ, 1984, 11TH P INT COLL AUT, P128

[10]

COMPLEMENT REDUCIBLE GRAPHS [J].

CORNEIL, DG ;

LERCHS, H ;

BURLINGHAM, LS .

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

← 1 2 3 4 →