Sciweavers

Share
HPCC
2005
Springer

A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers

10 years 9 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 from each other. Application examples include numerical optimization and channel assignment. We present the first distributed-memory heuristic algorithm for this NP-hard problem. Parallel speedup is achieved through graph partitioning, speculative (iterative) coloring, and a BSP-like organization of computation. Experimental results show that the algorithm is scalable, and compares favorably with an alternative approach—solving the problem on a graph G by first constructing the square graph G2 and then applying a parallel distance-1 coloring algorithm on G2 .
Doruk Bozdag, Ümit V. Çatalyürek,
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where HPCC
Authors Doruk Bozdag, Ümit V. Çatalyürek, Assefaw Hadish Gebremedhin, Fredrik Manne, Erik G. Boman, Füsun Özgüner
Comments (0)
books