1458 search results - page 6 / 292 » An Improved Parallel Algorithm for Delaunay Triangulation on... |
132
click to vote
EUROPAR
2005
Springer
15 years 8 months ago
2005
Springer
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
110
click to vote
HPCC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
112
click to vote
IPPS
1996
IEEE
15 years 6 months ago
1996
IEEE
In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for paralle...
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
