Locally computable enumerations
This paper is an extended and modified version of . 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  by the author.
KeywordsAlgorithms distributed systems graphs local computations
Unable to display preview. Download preview PDF.
- D. Angluin, Global and local properties in networks of processors, Proc. 12th Symposium on the Theory of Computing (1980) 82–93Google Scholar
- H. Garcia-Molina, Election in a distributed computing system, IEEE Trans. Comp. 31 (1982) 48–59Google Scholar
- R.E, Johnson and F.B. Schneider, Symmetry and similarity in distributed systems, Proc. 4th Conference on Principles of Distributed Computing, (1985) 13–22Google Scholar
- G. Le Lann, Distributed systems — towards a formal approach, in: B. Gilchrist, ed., Information Processing 77 (IFIP) (North-Holland, Amsterdam, 1977) 155–160Google Scholar
- 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)Google Scholar
- 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.Google Scholar
- A. Mazurkiewicz, Distributed Enumeration, Inform. Process. Lett. (in print).Google Scholar
- 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).Google Scholar
- M. Raynal, Distributed Algorithms and Protocols (J. Wiley & Sons, New York) (1988)Google Scholar