Sciweavers

1458 search results - page 6 / 292
» An Improved Parallel Algorithm for Delaunay Triangulation on...
Sort
View
EUROPAR
2005
Springer
14 years 2 months ago
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers
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...
Erik G. Boman, Doruk Bozdag, Ümit V. Ç...
HPCC
2005
Springer
14 years 2 months ago
A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers
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...
Doruk Bozdag, Ümit V. Çatalyürek,...
IPPS
1996
IEEE
14 years 21 days ago
Practical Algorithms for Selection on Coarse-Grained Parallel Computers
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...
Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, S...
SPAA
2003
ACM
14 years 1 months ago
Improved approximation algorithms for the freeze-tag problem
Esther M. Arkin, Michael A. Bender, Dongdong Ge