Related Experiment Video
Updated: Oct 14, 2025

Revealing Neural Circuit Topography in Multi-Color
Published on: November 14, 2011
Improved distributed -coloring
Mohsen Ghaffari1, Juho Hirvonen2, Fabian Kuhn3
1ETH Zurich, Zürich, Switzerland.
Abstract:
We present a randomized distributed algorithm that computes a -coloring in any non-complete graph with maximum degree in rounds, as well as a randomized algorithm that computes a -coloring in rounds when . Both these algorithms improve on an -round algorithm of Panconesi and Srinivasan (STOC'93), which has remained the state of the art for the past 25 years. Moreover, the latter algorithm gets (exponentially) closer to an round lower bound of Brandt et al. (STOC'16).
Related Concept Videos
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
pV-Diagrams
Karyotyping
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Bewley Lattice Diagram
Ogive Graph

