AN OPTIMAL PARALLEL ALGORITHM FOR THE MINIMUM CIRCLE-COVER PROBLEM

被引：13

作者：

ATALLAH, MJ

CHEN, DZ

机构：

来源：

INFORMATION PROCESSING LETTERS | 1989年 / 32卷 / 04期

关键词：

D O I：

10.1016/0020-0190(89)90037-9

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

收藏

页码：159 / 165

页数：7

相关论文

共 7 条

[1] PARALLEL CIRCLE-COVER ALGORITHMS [J].

BERTOSSI, AA .

INFORMATION PROCESSING LETTERS, 1988, 27 (03) :133-139

[2] PARALLEL MERGE SORT [J].

COLE, R .

SIAM JOURNAL ON COMPUTING, 1988, 17 (04) :770-785

[3] APPROXIMATE PARALLEL SCHEDULING .1. THE BASIC TECHNIQUE WITH APPLICATIONS TO OPTIMAL PARALLEL LIST RANKING IN LOGARITHMIC TIME [J].

COLE, R ;

VISHKIN, U .

SIAM JOURNAL ON COMPUTING, 1988, 17 (01) :128-142

[4] THE POWER OF PARALLEL PREFIX [J].

KRUSKAL, CP ;

RUDOLPH, L ;

SNIR, M .

IEEE TRANSACTIONS ON COMPUTERS, 1985, 34 (10) :965-968

[5] PARALLEL PREFIX COMPUTATION [J].

LADNER, RE ;

FISCHER, MJ .

JOURNAL OF THE ACM, 1980, 27 (04) :831-838

[6] ON A CIRCLE-COVER MINIMIZATION PROBLEM [J].

LEE, CC ;

LEE, DT .

INFORMATION PROCESSING LETTERS, 1984, 18 (02) :109-115

[7] AN EFFICIENT PARALLEL BICONNECTIVITY ALGORITHM [J].

TARJAN, RE ;

VISHKIN, U .

SIAM JOURNAL ON COMPUTING, 1985, 14 (04) :862-874