Experimental analysis of simple, distributed vertex coloring algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A framework for scalable greedy coloring on distributed-memory parallel computers
Journal of Parallel and Distributed Computing
Distributed (δ+1)-coloring in linear (in δ) time
Proceedings of the forty-first annual ACM symposium on Theory of computing
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Deterministic distributed vertex coloring in polylogarithmic time
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
About randomised distributed graph colouring and graph partition algorithms
Information and Computation
Distributed coloring in Õ (√log n) Bit Rounds
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Distributed graph coloring in a few rounds
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On greedy graph coloring in the distributed model
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
A scalable parallel graph coloring algorithm for distributed memory computers
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Speeding up parallel graph coloring
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
A distributed algorithm for a b-coloring of a graph
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
On the time and the bit complexity of distributed randomised anonymous ring colouring
Theoretical Computer Science
Symmetry breaking depending on the chromatic number or the neighborhood growth
Theoretical Computer Science
Information and Computation
Hi-index | 0.89 |