A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
Explicit construction of exponential sized families of K-independent sets
Discrete Mathematics
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
A fast parallel algorithm for the maximal independent set problem
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science
Distributed (δ+1)-coloring in linear (in δ) time
Proceedings of the forty-first annual ACM symposium on Theory of computing
What can be observed locally? round-based models for quantum distributed computing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Deterministic distributed vertex coloring in polylogarithmic time
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Scalable quantum consensus for crash failures
DISC'10 Proceedings of the 24th international conference on Distributed computing
Fast distributed graph partition and application
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Reliably detecting connectivity using local graph traits
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Toward more localized local algorithms: removing assumptions concerning global knowledge
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Quantum algorithms for subset finding
Quantum Information & Computation
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
Journal of the ACM (JACM)
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Sensor networks: distributed algorithms reloaded – or revolutions?
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Fast deterministic distributed algorithms for sparse spanners
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
On the locality of some NP-complete problems
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
This paper deals with distributed graph algorithms. Processors reside in the vertices of a graph G and communicate only with their neighbors. The system is synchronous and reliable, there is no limit on message lengths and local computation is instantaneous. The results: A maximal independent set in an n-cycle cannot be found faster than Ω(log* n) and this is optimal by [CV]. The d-regular tree of radius r cannot be colored with fewer than √d colors in time 2r / 3. If Δ is the largest degree in G which has order n, then in time O(log*n) it can be colored with O(Δ2) colors.