Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols

From MaRDI portal

Publication:4652605

Jump to:navigation, search

DOI10.1137/S0895480101386450zbMath1101.68005MaRDI QIDQ4652605

Michele Flammini, Stéphane Pérennes

Publication date: 28 February 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

gossiping broadcasting lower bounding technique general and specific networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12)

Related Items (2)

Faster gossiping on butterfly networks ⋮ Gossiping and routing in undirected triple-loop networks

This page was built for publication: Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4652605&oldid=18848922"