Fast gossiping by short messages

SIAM Journal on Computing

Volumn 27, Issue 4, 1998, Pages 917-941

  Bermond, Jean Claude ^a   Gargano, Luisa ^a   Rescigno, Adele A ^a   Vaccaro, Ugo ^a  

^a CNRS   (France)

Author keywords

Gossiping; Graphs; Networks

Indexed keywords

EID: 0003233397     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795283619     Document Type: Article

References (2)

1. N. ALON, F.R.K. CHUNG, AND R.L. GRAHAM, Routing permutations on graphs via matchings, in Proc. 25th ACM Symposium on the Theory of Computing (STOC '93), San Diego, CA, 1993, pp. 583-591.
2. B. ALSPACH, The classification of Hamiltonian generalized Petersen graphs, J. Combin. Theory Ser. B, 34 (1983), pp. 293-312.