We discuss eleven well-known basic models of distributed computing: four message-passing models that differ by the (non-existence of port-numbers and a hierarchy of seven local computations models. In each of these models, we study the computational complexity of the decision problem whether the leader election and/or naming problem can be solved on a given network. It is already known that this problem is solvable in polynomial time for two models and co-NP-complete for another one. Here, we settle the computational complexity for the remaining eight problems by showing co-NP-completeness. The results for six models and the already known co-NP-completeness result follow from a more general result on graph labelings. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Chalopin, J., & Paulusma, D. (2006). Graph labelings derived from models in distributed computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4271 LNCS, pp. 301–312). Springer Verlag. https://doi.org/10.1007/11917496_27
Mendeley helps you to discover research relevant for your work.