Sciweavers

26 search results - page 6 / 6
» Deterministic distributed vertex coloring in polylogarithmic...
Sort
View
DC
2010
13 years 5 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer