Graph Coloring on a Coarse Grained Multiprocessor

Authors:
Assefaw Hadish Gebremedhin;Isabelle Guérin Lassous;Jens Gustedt;Jan Arne Telle
Affiliations:
-;-;-;-
Venue:
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
2000

Citing 3
Cited 0

A bridging model for parallel computation

Communications of the ACM
LogP: towards a realistic model of parallel computation

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Towards efficiency and portability: programming with the BSP model

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first efficient algorithm for a coarse grained multiprocessor that colors a graph G with a guarantee of at most ΔG+1 colors.