PARALLEL GRAPH ALGORITHMS THAT ARE EFFICIENT ON AVERAGE

被引:6
作者
COPPERSMITH, D
RAGHAVAN, P
TOMPA, M
机构
关键词
D O I
10.1016/0890-5401(89)90035-7
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:318 / 333
页数:16
相关论文
共 50 条
[41]   PARALLEL AND ONLINE GRAPH-COLORING ALGORITHMS [J].
HALLDORSSON, MM .
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 650 :61-70
[42]   Graph Coloring in a Class of Parallel Local Algorithms [J].
Evstigneev, V. A. ;
Kyzy, Y. Tursunbay .
NUMERICAL ANALYSIS AND APPLICATIONS, 2011, 4 (03) :189-198
[43]   Computation of watersheds based on parallel graph algorithms [J].
Meijster, A ;
Roerdink, JBTM .
MATHEMATICAL MORPHOLOGY AND ITS APPLICATIONS TO IMAGE AND SIGNAL PROCESSING, 1996, :305-312
[44]   GRAPH THEORETICAL METHODS FOR THE DESIGN OF PARALLEL ALGORITHMS [J].
REISCHUK, R .
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 529 :61-67
[45]   Graph-based algorithms for parallel processes [J].
Yordanova, S .
16TH ANNUAL INTERNATIONAL SYMPOSIUM ON HIGH PERFORMANCE COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2002, :114-115
[46]   A Unifying Programming Model for Parallel Graph Algorithms [J].
Willcock, Jeremiah ;
Lumsdaine, Andrew .
2015 IEEE 29TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS, 2015, :831-840
[47]   Efficient Algorithms for Graph Coloring on GPU [J].
Nguyen Quang Anh Pham ;
Fan, Rui .
2018 IEEE 24TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS 2018), 2018, :449-456
[48]   Efficient graph coloring by evolutionary algorithms [J].
Drechsler, Nicole ;
Guenther, Wolfgang ;
Drechsler, Rolf .
COMPUTATIONAL INTELLIGENCE: THEORY AND APPLICATIONS, 1999, 1625 :30-39
[49]   Efficient θ-subsumption based on graph algorithms [J].
Scheffer, T ;
Herbrich, R ;
Wysotzki, F .
INDUCTIVE LOGIC PROGRAMMING, 1997, 1314 :212-228
[50]   Adjacency Maps and Efficient Graph Algorithms [J].
Valiente, Gabriel .
ALGORITHMS, 2022, 15 (02)