Randomized distributed algorithm for vertex coloring

Authors:
S. Choudhary;G. N. Purohit
Affiliations:
Banasthali University, C-Scheme, Jaipur;Banasthali University, C-Scheme, Jaipur
Venue:
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Year:
2010

Citing 14
Cited 0

A fast parallel algorithm for the maximal independent set problem

Journal of the ACM (JACM)
A fast and simple randomized parallel algorithm for the maximal independent set problem

Journal of Algorithms
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A simple parallel algorithm for the maximal independent set problem

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Locality in distributed graph algorithms

SIAM Journal on Computing
A unified framework and algorithm for channel assignment in wireless networks

Wireless Networks
Experimental analysis of simple, distributed vertex coloring algorithms

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An efficient distributed algorithm for constructing small dominating sets

Distributed Computing - Special issue: Selected papers from PODC '01
An experimental study of a simple, distributed edge-coloring algorithm

Journal of Experimental Algorithmics (JEA)
Distributed approximation: a survey

ACM SIGACT News
The price of being near-sighted

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the complexity of distributed graph coloring

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A log-star distributed maximal independent set algorithm for growth-bounded graphs

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Distributed (δ+1)-coloring in linear (in δ) time

Proceedings of the forty-first annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many computational tasks require the cooperation of many processors in the network, but prohibit certain processors pair (or large group) from operating simultaneously. This symmetry breaking technique play a major role in distributed network algorithm. Two symmetry breaking task of "localized" nature are coloring (Vertex Coloring) and Maximal Independence Set (MIS). In this paper, we present an experimental analysis of simple and elegant randomized distributed algorithm for vertex coloring problem