Minimal sense of direction in regular networks

Information Processing Letters

Volumn 61, Issue 6, 1997, Pages 331-338

  Flocchini, Paola ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Cayley graphs; Distributed computing; Graph labelings; Sense of Direction

Indexed keywords

EID: 0013301355     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00031-8     Document Type: Article

References (29)

1. S. Akers and B. Krishamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Trans. Comput. 38 (4) (1989) 555-566.
2. H. Attiya, J. v. Leeuwen, N. Santoro and S. Zaks, Efficient elections in chordal ring networks, Algorithmica 4 (1989) 437-446.
3. H. Attiya, M. Snir and M. Warmuth, Computing on an anonymous ring, J. ACM 35 (4) (1988) 845-875.
4. P. Beame and H. Bodlaender, Distributed computing on transitive networks: The torus, in: Proc. 6th Symp. on Theoretical Aspects of Computer Science (1989) 294-303.
5. J.-C. Bermond, O. Favaron and M. Maheo, Hamiltonian decomposition of Cayley graphs of degree four, J. Combin. Theory B 46 (1989) 142-153.
6. P. Boldi and S. Vigna, On the complexity of deciding sense of direction, in: Proc. 2nd Coll. on Structural Information and Communication Complexity, Olympia, 1995, International Informatic Series, Vol. 2 (Carleton University Press) 39-52.
7. G. Cooperman and L. Finkelstein, New methods for using Cayley graphs in interconnection networks, Discrete Appl. Math. 37 (1992) 95-118.
8. P. Flocchini and B. Mans, Optimal election in labeled hypercubes, J. Parallel Distributed Comput. 33 (1) (1996) 76-83.
9. P. Flocchini, B. Mans and N. Santoro, Sense of direction: formal definition and properties, in: Proc. 1st Coll. on Structural Information and Communication Complexity, Ottawa, Canada, 1994, International Informatic Series, Vol. 1 (Carleton University Press) 9-34.
10. P. Flocchini, B. Mans and N. Santoro, Translation properties of sense of direction, in: Proc. 2nd Coll. on Structural Information and Communication Complexity, Olympia, 1995, International Informatic Series, Vol. 2 (Carleton University Press) 13-26.
11. P. Flocchini and N. Santoro, Topological constraints for sense of direction, in: Proc. 2nd Coll. on Structural Information and Communication Complexity, Olympia, 1995, International Informatic Series, Vol. 2 (Carleton University Press) 27-38.
12. A. Israeli and M. Jalfon, Uniform self-stabilizing ring orientation, Inform. and Comput. 104 (2) (1993) 175-196.
13. A. Israeli, E. Kranakis, D. Krizanc and N. Santoro, Time-message trade-offs for the weak unison problem, in: Proc. Conf. on Algorithms and Complexity, Lecture Notes in Computer Science, Vol. 778 (Springer, Berlin, 1994) 167-178.
14. T. Kalamboukis and S. Mantzaris, Towards optimal distributed election on chordal rings, Inform. Process. Lett. 38 (1991) 265-270.
15. E. Kranakis and D. Krizanc, Distributed computing on anonymous hypercubes, in: Proc. 3rd IEEE Symp. on Parallel and Distributed Processing, Dallas (1991) 722-729.
16. E. Kranakis and D. Krizanc, Distributed computing on Cayley networks, in: Proc. 4th IEEE Symp. on Parallel and Distributed Processing, Arlington (1992) 222-229.
17. E. Kranakis and D. Krizanc, Labeled versus unlabeled distributed Cayley networks, in: Proc. 1st Coll. on Structural Information and Communication Complexity, Ottawa, 1994, International Informatic Series, Vol 1 (Carleton University Press) 71-82.
18. S. Lakshmivarahan, J.-S. Jwo and S. Dhall, Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey, Parallel Comput. 19 (1993) 361-407.
19. M. Loui, T. Matsushita and D. West, Election in complete networks with a sense of direction, Inform. Process. Lett. 22 (1986) 185-187; also: Inform. Process. Lett. 28 (1988) 327.
20. M. Loui, T. Matsushita and D. West, Election in complete networks with a sense of direction, Inform. Process. Lett. 22 (1986) 185-187; also: Inform. Process. Lett. 28 (1988) 327.
21. B. Mans and N. Santoro, On the impact of sense of direction in arbitrary networks, in: Proc. 14th Internat. Conf. on Distributed Computing Systems, Poznan (1994) 258-265.
22. S. Mantzaris, Almost optimal election in chordal rings, in: Proc. Conf. on Parallel and Distributed Computing in Engineering Systems (1991) 459-464.
23. G. Masapati and H. Ural, Effect of preprocessing on election in a complete network with a sense of direction, in: Proc. IEEE Internat. Conf. on Systems, Man and Cybernetics, Vol. 3 (1991) 1627-1632.
24. T. Masuzawa, N. Nishikawa, K. Hagihara and 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) 171-182.
25. Y. Pan, An improved election algorithm in chordal ring networks, Internat. J. Comput. Math. 40 (3-4) (1991) 191-200.
26. G. Peterson, Efficient algorithms for elections in meshes and complete networks, Tech. Rept. TR-140, Dept. of Computer Science, University of Rochester, Rochester, NY, 1985.
27. S. Robbins and K. Robbins, Choosing a leader on a hypercube, in: Proc. Internat. Conf. on Databases, Parallel Architectures and their Applications, Miami Beach (1990) 469-471.
28. S. Schibell and R. Stafford, Processor interconnection networks from Cayley graphs, Discrete Appl. Math. 40 (1992) 333-357.
29. G. Tel, Network orientation, Internat. J. Foundations Comput. Sci. 5 (1) (1994).