Abstract
This paper is an extended and modified version of [10]. A protocol with local rules is presented for enumerating anonymous nodes of finite graphs. It is proved that such algorithms do not exists for the class of ambiguous graphs, defined in the paper; the proposed algorithm works successfully for remaining non-ambiguous graphs. It is also proved that protocol is fair, which means that no enumeration of nodes is discriminated by the protocol and that all individual nodes “know” the fact of successful termination of the protocol activity, provided the number of nodes of a graph is known to the protocol. The described protocol is a generalization of that presented in [9] by the author.
partially supported by grant KBN 8T11C 029 08
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin, Global and local properties in networks of processors, Proc. 12th Symposium on the Theory of Computing (1980) 82–93
B. Courcelle and Y. Métivier, Coverings and minors: application to local computations on graphs, Europ. J. of Combinatorics 15 (1994) 127–138.
E.W. Dijkstra, Solution of a problem in concurrent programming control, Comm. ACM 8 (1965) 569.
H. Garcia-Molina, Election in a distributed computing system, IEEE Trans. Comp. 31 (1982) 48–59
R.E, Johnson and F.B. Schneider, Symmetry and similarity in distributed systems, Proc. 4th Conference on Principles of Distributed Computing, (1985) 13–22
G. Le Lann, Distributed systems — towards a formal approach, in: B. Gilchrist, ed., Information Processing 77 (IFIP) (North-Holland, Amsterdam, 1977) 155–160
I. Litovsky and Y. Métivier, Graph rewritting systems as a tool to design and to prove graph and network algorithms, Internal Rept. 9070, LaBRI, Université de Bordeaux I (1990)
I. Litovsky, Y. Métivier and W. Zielonka, The power and limitations of local computations an graphs and networks, Lecture Notes in Comp. Sci. 657 (1993) 333–345.
A. Mazurkiewicz, Solvability of the asynchronous ranking problem, Inform. Process. Lett. 28 (1988) 221–224.
A. Mazurkiewicz, Distributed Enumeration, Inform. Process. Lett. (in print).
Y. Métivier, A. Muscholl and P.-A. Wacrenier, About the local detection of termination of local computations in graphs, Working paper of French-German project PROCOPE, (1997).
M. Raynal, Distributed Algorithms and Protocols (J. Wiley & Sons, New York) (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mazurkiewicz, A. (1997). Locally computable enumerations. In: Chlebus, B.S., Czaja, L. (eds) Fundamentals of Computation Theory. FCT 1997. Lecture Notes in Computer Science, vol 1279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036171
Download citation
DOI: https://doi.org/10.1007/BFb0036171
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63386-0
Online ISBN: 978-3-540-69529-5
eBook Packages: Springer Book Archive