Antoni W. Mazurkiewicz

Learn More
Finite, undirected graphs without self-loops are considered in the paper. The goal is to nd a protocol for local computation which, starting with a uniform labelling of graph nodes, eventually terminates with a labelling being an enumeration of nodes. It is known from 4] that for some (\ambiguous") graphs of the considered family such a protocol does not(More)