DECOMPOSITION TREES - STRUCTURED GRAPH REPRESENTATION AND EFFICIENT ALGORITHMS

被引：0

作者：

LAUTEMANN, C

机构：

来源：

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：28 / 39

页数：12

共 12 条

[1]

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

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

[3]

ARNBORG S, 1987, PROBLEMS ARE EASY TR

[4]

Garey MR., 1979, COMPUTERS INTRACTABI

[5]

HABEL A, 1987, LNCS, V247, P207

[6]

HABEL A, IN PRESS 3RD P INT W

[7]

KREOWSKI HJ, 1986, RULE TREES HELP ESCA

LANGE, KJ ;

WELZL, E .

[9]

LENGAUER T, 1986, LNCS, V216, P153

[10] GRAPH MINORS .2. ALGORITHMIC ASPECTS OF TREE-WIDTH [J].

ROBERTSON, N ;

SEYMOUR, PD .