Abstract
We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its neighbours. We characterise the graphs for which two important distributed algorithmic problems are solvable in this model: naming and election.
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
Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Symposium on Theory of Computing, pp. 82–93 (1980)
Attiya, H., Welch, J.: Distributed computing: fundamentals, simulations, and advanced topics. McGraw-Hill, New York (1998)
Boldi, P., Codenotti, B., Gemmell, P., Shammah, S., Simon, J., Vigna, S.: Symmetry breaking in anonymous networks: Characterizations. In: Proc. 4th Israeli Symposium on Theory of Computing and Systems, pp. 16–26. IEEE Press, Los Alamitos (1996)
Chalopin, J., Métivier, Y.: Election and local computations on edges (extended abstract). In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 90–104. Springer, Heidelberg (2004)
Godard, E., Métivier, Y., Muscholl, A.: Characterization of Classes of Graphs Recognizable by Local Computations. Theory of Computing Systems (37), 249–293 (2004)
LeLann, G.: Distributed systems: Towards a formal approach. In: Gilchrist, B. (ed.) Information processing 1977, pp. 155–160. North-Holland, Amsterdam (1977)
Lynch, N.A.: Distributed algorithms. Morgan Kaufmann, San Francisco (1996)
Mazurkiewicz, A.: Distributed enumeration. Inf. Processing Letters 61, 233–239 (1997)
Szymanski, B., Shy, Y., Prywes, N.: Terminating iterative solutions of simultaneous equations in distributed message passing systems. In: Proc. of the 4th Symposium of Distributed Computing, pp. 287–292 (1985)
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(1), 69–89 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chalopin, J., Métivier, Y., Zielonka, W. (2004). Election, Naming and Cellular Edge Local Computations. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds) Graph Transformations. ICGT 2004. Lecture Notes in Computer Science, vol 3256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30203-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-30203-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23207-0
Online ISBN: 978-3-540-30203-2
eBook Packages: Springer Book Archive