Graph coloring on coarse grained multicomputers

Authors:
Assefaw Hadish Gebremedhin;Isabelle Guérin Lassous;Jens Gustedt;Jan Arne Telle
Affiliations:
Department of Informatics, University of Bergen, 5020 Bergen, Norway;INRIA Rocquencourt, France;LORIA and INRIA Lorraine, France;Department of Informatics, University of Bergen, 5020 Bergen, Norway
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 16
Cited 1

New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P

IEEE Transactions on Computers
A simple parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
A fast parallel coloring of planar graphs with five colors

Information Processing Letters
A fast parallel algorithm to color graph with &Dgr; colors

Journal of Algorithms
An NC algorithm for Brooks' theorem

Theoretical Computer Science
A bridging model for parallel computation

Communications of the ACM
Brooks coloring in parallel

SIAM Journal on Discrete Mathematics
Parallel algorithms for shared-memory machines

Handbook of theoretical computer science (vol. A)
A parallel graph coloring heuristic

SIAM Journal on Scientific Computing
LogP: towards a realistic model of parallel computation

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Practical implementations and applications of graph coloring

Practical implementations and applications of graph coloring
Towards efficiency and portability: programming with the BSP model

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract)

MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
A Parallel Algorithm for Computing the Extremal Eigenvalues of Very Large Sparse Matrices

PARA '98 Proceedings of the 4th International Workshop on Applied Parallel Computing, Large Scale Scientific and Industrial Problems
Parallelism in random access machines

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Register allocation via coloring

Computer Languages

Iterative computations with ordered read-write locks

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.04

Visualization

Abstract

We present an efficient and scalable coarse grained multicomputer (CGM) coloring algorithm that colors a graph G with at most @D+1 colors where @D is the maximum degree in G. This algorithm is given in two variants: randomized and deterministic. We show that on a p-processor CGM model the proposed algorithms require a parallel time of O(|G|/p) and a total work and overall communication cost of O(|G|). These bounds correspond to the average case for the randomized version and to the worst case for the deterministic variant.