Minimal routing in the triangular grid and in a family of related Tori

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

Volumn 1300 LNCS, Issue , 1997, Pages 218-225

  Désérable, Dominique ^a  

^a INSA DE RENNES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CAYLEY GRAPHS; CO-ORDINATE SYSTEM; DESTINATION NODES; SHORTEST PATH; SHORTEST PATH ROUTING; TRIANGULAR GRID;

GRAPH THEORY;

EID: 80053118465     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0002736     Document Type: Conference Paper

References (7)

1. M.S. Chen, K.G. Shin, D.D. Kandlur: Addressing, routing, and broadcasting in hexagonal mesh multiprocessors. IEEE Trans. Comp. 39 (1) (1990) 10-18
2. W.J. Dally, C.L. Seitz: The torus routing chip. Distributed Computing 1 (1986) 187-96
3. A. Davis: Mayfly - a general-purpose, scalable, parallel processing architecture. J. LISP and Symbolic Computation 5 (1992) 7-47
4. A.L. Davis, S.V. Robison: The architecture of the FAIM-1 symbolic multiprocessing system. Proc. 9-th Int. Joint. Conf. on Artificial Intelligence (1985) 32-38
5. D. Désérable: Broadcasting in the arrowhead torus. Parallel Processing, Lecture Notes in Computer Sciences 854, Springer-Verlag (1994) 808-19
6. D. Désérable: A family of Cayley graphs on the hexavalent grid (to appear in Discrete Applied Math.)
7. A. Rosenfeld, P. Pfaltz: Distance functions on digital pictures. Pattern Recognition 1 (1968) 33-61