Groupings and pairings in anonymous networks

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

Volumn 4167 LNCS, Issue , 2006, Pages 105-119

  Chalopin, Jérémie ^a   Das, Shantanu ^b   Santoro, Nicola ^c  

^a UNIVERSITÉ DE BORDEAUX   (France)

^b UNIVERSITY OF OTTAWA   (Canada)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; PROBLEM SOLVING; PROGRAM PROCESSORS;

ANONYMOUS NETWORKS; K- GROUPING PROBLEM;

COMPUTER NETWORKS;

EID: 33845208783     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11864219_8     Document Type: Conference Paper

References (17)

1. D. Angluin. Local and global properties in networks of processors. In Proc. 12th ACM Symp. on Theory of Computing (STOC '80), 82-93, 1980.
2. P. Boldi, B. Codenotti, P. Gemmell, S. Shammah, J. Simon, and S. Vigna. Symmetry breaking in anonymous networks: Characterizations. In Proc. of 4th Israeli Symposium on Theory of Computing and Systems(ISTCS'96), 16-26, 1996.
3. P. Boldi and S. Vigna. An effective characterization of computability in anonymous networks. In Proc. 15th Int. Conference on Distributed Computing (DISC'01), 33-47, 2001.
4. P. Boldi and S. Vigna. Fibrations of graphs. Discrete Math., 243:21-66, 2002.
5. A. Cardon and M. Crochemore. Partitioning a Graph in O(|A|log2|V|). Theoretical Computer Science, 19:85-98, 1982.
6. J. Chalopin and Y. Métivier. A bridge between the asynchronous message passing model and local computations in graphs (extended abstract). In Proc. of Mathematical Foundations of Computer Science, MFCS'05, volume 3618 of LNCS, pages 212-223, 2005.
7. D.G. Corneil and C.C. Gotlieb. An Efficient Algorithm for Graph Isomorphism. Journal of the ACM, 17(1):51-74, 1970.
8. P. Flocchini, A. Roncato, and N. Santoro. Computing on anonymous networks with Sense of Direction. Theoretical Computer Science, 301, 355-379, 2003.
9. E. Godard, Y. Métivier, and A. Muscholl. Characterization of classes of graphs recognizable by local computations. Theory of Computing Systems, 37(2):249-293, 2004.
10. R.E. Johnson and F.B. Schneider. Symmetry and similarity in distributed systems. In Proc. 4th Annual ACM Symp. on Principles of Distributed Computing (PODC '85), 13-22, 1985.
11. E. Kranakis. Symmetry and computability in anonymous networks: A brief survey. In Proc. 3rd Int. Conf. on Structural Information and Communication Complexity (SIROCCO '97), 1-16, 1997.
12. F. T. Leighton. Finite common coverings of graphs. J. Combin. Theory, Ser. B, 33:231-238, 1982.
13. A. Mazurkiewicz. Distributed enumeration. Inf. Processing Letters, 61(5):233-239, 1997.
14. S.J. Mullender and P.M.B. Vitanyi. Distributed match-making. Algorithmica, 3: 367-391, 1998.
15. N. Sakamoto. Comparison of initial conditions for distributed algorithms on anonymous networks. In Proc. 18th ACM Symposium on Principles of Distributed Computing (PODC '99), 173-179, 1999.
16. M. Yamashita and T. Kameda. Computing on anonymous networks: Parts I and II. IEEE Trans. Parallel and Distributed Systems, 7(1):69-96, 1996.
17. M. Yamashita and T. Kameda. Computing functions on asynchronous anonymous networks. Mathematical Systems Theory, 29:331-356, 1996.