Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Boldi, P., Vigna, S.: Fibrations of graphs. Discrete Mathematics 243, 21–66 (2002)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London and Elsevier, New York (1976)
Chalopin, J.: Election and Local Computations on Closed Unlabelled Edges. In: SOFSEM 2005. LNCS, vol. 3381, pp. 81–90. Springer, Heidelberg (2005)
Chalopin, J., Métivier, Y.: Election and Local Computations on Edges. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 90–104. Springer, Heidelberg (2004)
Chalopin, J., Métivier, Y.: A Bridge between the Asynchronous Message Passing Model and Local Computations in Graphs. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 212–223. Springer, Heidelberg (2005)
Chalopin, J., Métivier, Y., Zielonka, W.: Election, naming and cellular edge local computations. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 242–256. Springer, Heidelberg (2004)
Fiala, J., Paulusma, D., Telle, J.A.: Matrix and Graph Orders derived from locally constrained homomorphisms. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 340–351. Springer, Heidelberg (2005)
Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co., New York (1979)
Kratochvíl, J., Proskurowski, A., Telle, J.A.: Complexity of graph covering problems. Nordic Journal of Computing 5, 173–195 (1998)
Mazurkiewicz, A.: Distributed enumeration. Information Processing Letters 61, 233–239 (1997)
Mazurkiewicz, A.: Bilateral ranking negotiations. Fundamenta Informaticae 60, 1–16 (2004)
Tel, G.: Introduction to distributed algorithms. Cambridge University Press, Cambridge (2000)
Yamashita, M., Kameda, T.: Computing on anonymous networks: Part I - Characterizing the solvable cases. IEEE Transactions on parallel and distributed systems 7, 69–89 (1996)
Yamashita, M., Kameda, T.: Computing on anonymous networks: Part II - decision and membership problems. IEEE Transactions on parallel and distributed systems 7, 90–96 (1996)
Yamashita, M., Kameda, T.: Leader election problem on networks in which processor identity numbers are not distinct. IEEE Transactions on parallel and distributed systems 10, 878–887 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chalopin, J., Paulusma, D. (2006). Graph Labelings Derived from Models in Distributed Computing. In: Fomin, F.V. (eds) Graph-Theoretic Concepts in Computer Science. WG 2006. Lecture Notes in Computer Science, vol 4271. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11917496_27
Download citation
DOI: https://doi.org/10.1007/11917496_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48381-6
Online ISBN: 978-3-540-48382-3
eBook Packages: Computer ScienceComputer Science (R0)