A Better Practical Algorithm for Distributed Graph Coloring

Authors:
Marek Kubale;lukasz Kuszner
Affiliations:
-;-
Venue:
PARELEC '02 Proceedings of the International Conference on Parallel Computing in Electrical Engineering
Year:
2002

Citing 0
Cited 3

A multi-channel defense against jamming attacks in wireless sensor networks

Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks
An Automatic Presence Service for Low Duty-Cycled Mobile Sensor Networks

Mobile Networks and Applications
On greedy graph coloring in the distributed model

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper we present a new distributed algorithm for coloring the vertices of a graph. A practical simulation shows that this algorithmperforms much better then a naive distributed algorithm.