Advertisement

Graph Labelings Derived from Models in Distributed Computing

  • Jérémie Chalopin
  • Daniël Paulusma
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4271)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    Boldi, P., Vigna, S.: Fibrations of graphs. Discrete Mathematics 243, 21–66 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London and Elsevier, New York (1976)Google Scholar
  4. 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
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co., New York (1979)zbMATHGoogle Scholar
  10. 10.
    Kratochvíl, J., Proskurowski, A., Telle, J.A.: Complexity of graph covering problems. Nordic Journal of Computing 5, 173–195 (1998)zbMATHMathSciNetGoogle Scholar
  11. 11.
    Mazurkiewicz, A.: Distributed enumeration. Information Processing Letters 61, 233–239 (1997)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Mazurkiewicz, A.: Bilateral ranking negotiations. Fundamenta Informaticae 60, 1–16 (2004)zbMATHMathSciNetGoogle Scholar
  13. 13.
    Tel, G.: Introduction to distributed algorithms. Cambridge University Press, Cambridge (2000)zbMATHGoogle Scholar
  14. 14.
    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)CrossRefGoogle Scholar
  15. 15.
    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)CrossRefGoogle Scholar
  16. 16.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jérémie Chalopin
    • 1
  • Daniël Paulusma
    • 2
  1. 1.LaBRI Université Bordeaux 1TalenceFrance
  2. 2.Department of Computer ScienceDurham University, Science LaboratoriesDurhamEngland

Personalised recommendations