Regular ArticleA Broadcasting Protocol in Line Digraphs☆
References (16)
- et al.
Hamilton circuits in directed wrapped butterfly network
Discrete Appl. Math.
(1998) - et al.
Broadcasting and spanning tree in De Bruijn and Kautz networks
Discrete Appl. Math.
(1992) - et al.
Broadcasting in bounded degree graphs
SIAM J. Discrete Math.
(1992) - et al.
Efficient broadcast protocols on the de Bruijn and similar networks
Proceedings of SIROCCO'95
(1995) - et al.
Broadcasting in De Bruijn networks
Proc. of the 19th S-E Conf. on Combin., Graph Theory and Comp.
(1988) - et al.
De Bruijn and Kautz bus Networks
Networks
(1997) - et al.
Induced broadcasting algorithms in iterated line digraphs
Proc. EUROPAR'96
(1996)
There are more references available in the full text version of this article.
Cited by (0)
- ☆
An extended abstract of this article was presented at “EUROPAR'96” and obtained the qualification of “distinguished paper” [6]. This work was partially supported by the HCM Network of Excellence project MAP. Part of this work was developed while J-C. Bermond and X. Muñoz were visiting the University of Rome “La Sapienza.”
- f1
E-mail: [email protected]
- f2
E-mail: [email protected]
- f3
E-mail: [email protected]
- 2
Supported by the French action RUMEUR of the GDR PRS.
- 3
Supported by the Spanish Research Council (Comisión Interministerial de Ciencia y Tecnologı́a, CICYT) under Project TIC 92-1228-E.
- 4
Supported by Project MURST 40% Algoritmi e strutture di calcolo.
Copyright © 2001 Academic Press. All rights reserved.