Graph Labelings Derived from Models in Distributed Computing
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.
Unable to display preview. Download preview PDF.
- 1.Boldi, P., Codenotti, B., Gemmell, P., Shammah, S., Simon, J., Vigna, S.: Symmetry breaking in anonymous networks: Characterizations. In: Proceedings of the 4th Israeli Symposium on Theory of Computing and Systems (ISTCS 1996), pp. 16–26. IEEE Press, Los Alamitos (1996)Google Scholar
- 3.Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London and Elsevier, New York (1976)Google Scholar
- 4.Chalopin, J.: Election and Local Computations on Closed Unlabelled Edges. In: SOFSEM 2005. LNCS, vol. 3381, pp. 81–90. Springer, Heidelberg (2005)Google Scholar