A characterization of families of graphs in which election is possible

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2303, Issue , 2002, Pages 159-171

  Godard, Emmanuel ^a   Métivier, Yves ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84855344139     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45931-6_12     Document Type: Conference Paper

References (11)

1. D. Angluin. Local and global properties in networks of processors. In Pro-ceedings of the 12th Symposium on theory of computing, pages 82–93, 1980.
2. P. Boldi and S. Vigna. Computing anonymously with arbitrary knowledge. In Proceedings of the 18th ACM Symposium on principles of distributed computing, pages 181–188. ACM Press, 1999.
3. J.-R. Fiksel, A. Holliger, and P. Rosenstiehl. Intelligent graphs. In R. Read, editor, Graph theory and computing, pages 219–265. Academic Press (New York), 1972.
4. E. Godard. A self-stabilizing enumeration algorithm. Inform. Proc. Letters, to appear.
5. T. Kameda and M. Yamashita. Computing on anonymous networks: Part i-characterizing the solvable cases. IEEE Transactions on parallel and distributed systems, 7(1):69–89, 1996.
6. W. S. Massey. A basic course in algebraic topology. Springer-Verlag, 1991. Graduate texts in mathematics.
7. A. Mazurkiewicz. Distributed enumeration. Inf. Processing Letters, 61:233–239, 1997.
8. Y. Métivier, A. Muscholl, and P.-A. Wacrenier. About the local detection of termination of local computations in graphs. In International Colloquium on structural information and communication complexity, pages 188–200, 1997.
9. Y. Métivier and G. Tel. Termination detection and universal graph reconstruction. In International Colloquium on structural information and communication complexity, pages 237–251, 2000.
10. B. Szymanski, Y. Shy, and N. Prywes. Terminating iterative solutions of simultaneous equations in distributed message passing systems. In Proceedings of the 4th Symposium on Principles of Distributed computing, pages 287–292, 1985.
11. G. Tel. Introduction to distributed algorithms. Cambridge University Press, 2000.