About randomised distributed graph colouring and graph partition algorithms

We present and analyse a very simple randomised distributed vertex colouring algorithm for arbitrary graphs of size n that halts in time O ( log n ) with probability 1 - o ( n - 1 ) . Each message containing 1 bit, its bit complexity per channel is O ( log n ) . From this algorithm, we deduce and an...

Ausführliche Beschreibung