COMPLEXITY OF FINDING EMBEDDINGS IN A K-TREE

被引：684

作者：

ARNBORG, S

CORNEIL, DG

PROSKUROWSKI, A

机构：

[1] UNIV TORONTO,DEPT COMP SCI,TORONTO M5S 1A4,ONTARIO,CANADA

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

来源：

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1987年 / 8卷 / 02期

关键词：

D O I：

10.1137/0608024

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：277 / 284

页数：8

共 17 条

[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]

Arnborg S, 1984, TRITANA8404 ROYAL I

[5]

BONDY JA, 1976, GRAPH THEORY APPLICA

[6]

COLBOURN CJ, 1984, LECT NOTES COMPUT SC, V172, P128

[7]

CORNEIL DG, 1987, IN PRESS SIAM J ALGE, V8

[8] NETWORKS IMMUNE TO ISOLATED LINE FAILURES [J].

FARLEY, AM ;

PROSKUROWSKI, A .

NETWORKS, 1982, 12 (04) :393-403

[9] NETWORKS IMMUNE TO ISOLATED FAILURES [J].

FARLEY, AM .

NETWORKS, 1981, 11 (03) :255-268

[10]

Garey MR., 1979, COMPUTERS INTRACTABI

← 1 2 →