Complexity of network synchronization
Journal of the ACM (JACM)
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
A fast parallel algorithm to color graph with &Dgr; colors
Journal of Algorithms
Improved distributed algorithms for coloring and network decomposition problems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Locality in distributed graph algorithms
SIAM Journal on Computing
New approximation algorithms for graph coloring
Journal of the ACM (JACM)
Greed is good: approximating independent sets in sparse and bounded-degree graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Simple distributed&Dgr; + 1-coloring of graphs
Information Processing Letters
Fast distributed algorithms for Brooks-Vizing colorings
Journal of Algorithms
Fast distributed graph coloring with O(&Dgr;) colors
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
New approximation guarantee for chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the complexity of distributed graph coloring
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Network decomposition and locality in distributed computation
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
Proceedings of the twenty-seventh 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
Weak graph colorings: distributed algorithms and applications
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A new technique for distributed symmetry breaking
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Deterministic distributed vertex coloring in polylogarithmic time
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Toward more localized local algorithms: removing assumptions concerning global knowledge
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed coloring depending on the chromatic number or the neighborhood growth
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Trading bit, message, and time complexity of distributed algorithms
DISC'11 Proceedings of the 25th international conference on Distributed computing
| Hi-index | 5.23 |
We deterministically compute a @D+1 coloring and a maximal independent set(MIS) in time O(@D^1^/^2^+^@Q^(^1^/^h^)+log^*n) for @D"1"+"i@?@D^1^+^i^/^h, where @D"j is defined as the maximal number of nodes within distance j for a node and @D:=@D"1. Our greedy coloring and MIS algorithms improve the state-of-the-art algorithms running in O(@D+log^*n) for a large class of graphs, i.e., graphs of (moderate) neighborhood growth with h=36. We also state and analyze a randomized coloring algorithm in terms of the chromatic number, the run time and the used colors. Our algorithm runs in time O(log@g+log^*n) for @D@?@W(log^1^+^1^/^l^o^g^^^*^nn) and @g@?O(@D/log^1^+^1^/^l^o^g^^^*^nn). For graphs of polylogarithmic chromatic number the analysis reveals an exponential gap compared to the fastest @D+1 coloring algorithm running in time O(log@D+logn). The algorithm works without knowledge of @g and uses less than @D colors, i.e., (1-1/O(@g))@D with high probability. To the best of our knowledge this is the first distributed algorithm for (such) general graphs taking the chromatic number @g into account. We also improve on the state of the art deterministic computation of (2,c)-ruling sets.