COUNTING CLIQUE TREES AND COMPUTING PERFECT ELIMINATION SCHEMES IN PARALLEL

被引：52

作者：

HO, CW

LEE, RCT

机构：

[1] NATL TSING HUA UNIV,HSINCHU 300,TAIWAN

[2] ACAD SINICA,TAIPEI 115,TAIWAN

来源：

INFORMATION PROCESSING LETTERS | 1989年 / 31卷 / 02期

关键词：

D O I：

10.1016/0020-0190(89)90070-7

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：61 / 68

页数：8

共 23 条

[1] TIGHT COMPARISON BOUNDS ON THE COMPLEXITY OF PARALLEL SORTING [J].

AZAR, Y ;

VISHKIN, U .

SIAM JOURNAL ON COMPUTING, 1987, 16 (03) :458-464

[2] FINDING A MAXIMUM CLIQUE IN AN ARBITRARY GRAPH [J].

BALAS, E ;

YU, CS .

SIAM JOURNAL ON COMPUTING, 1986, 15 (04) :1054-1068

[3] ON THE DESIRABILITY OF ACYCLIC DATABASE SCHEMES [J].

BEERI, C ;

FAGIN, R ;

MAIER, D ;

YANNAKAKIS, M .

JOURNAL OF THE ACM, 1983, 30 (03) :479-513

[4]

Buneman P., 1974, Discrete Mathematics, V9, P205, DOI 10.1016/0012-365X(74)90002-8

[5] COVERING, PACKING AND GENERALIZED PERFECTION [J].

CHANG, GJ ;

NEMHAUSER, GL .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1985, 6 (01) :109-132

[6] DETERMINISTIC COIN TOSSING WITH APPLICATIONS TO OPTIMAL PARALLEL LIST RANKING [J].

COLE, R ;

VISHKIN, U .

INFORMATION AND CONTROL, 1986, 70 (01) :32-53

[7]

Dirac Gabriel Andrew, 1961, ABH MATH SEM HAMBURG, V25, P71, DOI [DOI 10.1007/BF02992776, 10.1007/BF02992776]

[8] INCIDENCE MATRICES AND INTERVAL GRAPHS [J].

FULKERSON, DR ;

GROSS, OA .

PACIFIC JOURNAL OF MATHEMATICS, 1965, 15 (03) :835-+

[9]

Gavril F., 1974, Journal of Combinatorial Theory, Series B, V16, P47, DOI 10.1016/0095-8956(74)90094-X

[10]

GILBERT J, 1984, SIAM J ALGEBRAIC DIS, V15, P306

← 1 2 3 →