Symmetries and sense of direction in labeled graphs

Discrete Applied Mathematics

Volumn 87, Issue 1-3, 1998, Pages 99-115

  Flocchini, Paola ^a,d   Roncato, Alessandro ^b   Santoro, Nicola ^c  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b Fac Sci Matematiche Fisische N   (Italy)

^c CARLETON UNIVERSITY   (Canada)

^d UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013192360     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00051-1     Document Type: Article

References (26)

1. D. Angluin, Local and global properties in networks of processors, in: Proc. 12th ACM Symposium on Theory of Computing, 1980, pp. 82-93.
2. H. Attiya, M. Snir, M.K. Warmuth, Computing on an anonymous ring, J. ACM 35 (4) (1988) 845-875.
3. F. Boesch, R. Tindell, Connectivity and symmetry in graphs, in: F. Harary and J. Maybee (Eds.), Graphs and Applications, Wiley, New York, 1984, 53-67.
4. P. Boldi, S. Vigna, On the complexity of deciding sense of direction, in: Proc. 2nd Colloquium on Structural Information and Communication Complexity, Olympia, 1995, pp. 39-52.
5. P. Boldi, S. Vigna, Sense of direction and decision problems for Cayley graphs, Inform. Process. Lett., to appear.
6. P. Flocchini, Minimal sense of direction in regular networks, Inform. Process. Lett. 61 (1997) 331-338.
7. P. Flocchini, B. Mans, Optimal election in labeled hypercubes, J. Parallel Distributed Comput. 33 (1) (1996) 76-83.
8. P. Flocchini, B. Mans, N. Santoro, Sense of direction: definition, properties and classes, Networks, to appear (Preliminary version in Proc. 1st Colloquium on Structural Information and Communication Complexity, 1994, pp. 9-34).
9. P. Flocchini, B. Mans, N. Santoro, On the impact of sense of direction on message complexity, Inform. Process. Lett. 63 (1) (1997) 23-31.
10. P. Flocchini, A. Roncato, N. Santoro, Computing on anonymous networks with sense of direction, Theoretical Comput. Sci., to appear (Preliminary version in Proc. 3rd Colloquium on Structural Information and Communication Complexity, 1996, pp. 32-46).
11. P. Flocchini, N. Santoro, Topological constraints for sense of direction, Internat. J. Found. Computer Sci., to appear (Preliminary version in Proc. 2nd Colloquium on Structural Information and Communication Complexity, 1995, pp. 27-38).
12. T.Z. Kalamboukis, S.L. Mantzaris, Towards optimal distributed election on chordal rings, Inform. Process. Lett. 38 (1991) 265-270.
13. E. Kranakis, D. Krizanc, J. van den Berg, Computing boolean functions on anonymous networks, in: Proc. 17th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 443, Springer, Berlin, 1990, pp. 254-267.
14. M.C. Loui, T.A. Matsushita, D.B. West, Election in complete networks with a sense of direction, Inform. Process. Lett. 22 (1986) 185-187; see also Inform. Process. Lett. 28 (1988) 327.
15. M.C. Loui, T.A. Matsushita, D.B. West, Election in complete networks with a sense of direction, Inform. Process. Lett. 22 (1986) 185-187; see also Inform. Process. Lett. 28 (1988) 327.
16. W. Magnus, A. Karrass, D. Solitar, Combinatorial Group Theory; Presentations of Groups in Terms of Generators and Relations, Interscience Publishers, New York, 1966.
17. B. Mans, N. Santoro, On the impact of sense of direction in arbitrary networks, in: Proc. 14th Internat. Conf. on Distributed Computing Systems, Poznan, 1994, pp. 258-265.
18. T. Masuzawa, N. Nishikawa, K. Hagihara, N. Tokura, Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction, in: Proc. 3rd Internat. Workshop on Distributed Algorithms, Lecture Notes in Computer Science, vol. 392, Springer, Berlin, 1989, pp. 171-182.
19. N. Norris, Classifying anonymous networks: when can two networks compute the same vector-valued functions?, in: Proc. 1st Colloquium on Structural Information and Communication Complexity, Ottawa, 1994, pp. 83-98.
20. N. Norris, Computing functions on partially wireless networks, in: Proc. 2nd Colloquium on Structural Information and Communication Complexity, Olympia, 1995, pp. 53-64.
21. N. Norris, Universal covers of graphs: isomorphism to depth n - 1 implies isomorphism to all depths, Discrete Appl. Math. 56 (1995) 61-74.
22. G. Singh, Efficient leader election using sense of direction, Distributed Comput. 10 (1997) 159-165.
23. I. Suzuki, M. Yamashita, Distributed anonymous mobile robots, in: Proc. 3rd Colloquium on Structural Information and Communication Complexity, Siena, 1996, pp. 313-330.
24. G. Tel, Sense of Direction in Processor Networks, in: Proc. of Conf. on Theory and Practice of Informatics, Lecture Notes in Computer Science, vol. 1012, Springer, Berlin, 1995, pp. 50-82.
25. M. Yamashita, T. Kameda, Computing on anonymous networks, in: Proc. 7th Symp. on Principles of Distributed Computing, 1988, pp. 117-130.
26. M. Yamashita, T. Kameda, Computing on anonymous networks. Part I: characterizing the solvable cases, IEEE Trans. Parallel and Distributed Comput. 7 (1) (1996) 69-89.