Fast gossiping by short messages

DOI10.1007/3-540-60084-1_69zbMath1412.68013OpenAlexW1538663268MaRDI QIDQ4645173

Jean-Claude Bermond, Adele A. Rescigno, Ugo Vaccaro, Luisa Gargano

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_69

zbMATH Keywords

complete bipartite graphcomplete graphPetersen graphshort messagecommunication round

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

On temporal graph exploration ⋮ Concurrent multicast in weighted networks ⋮ Communication complexity of gossiping by packets ⋮ Optimal sequential gossiping by short messages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The classification of Hamiltonian generalized Petersen graphs
• Fast gossiping with short unreliable messages
• Methods and problems of communication in usual networks
• A survey of gossiping and broadcasting in communication networks
• Gossiping in Minimal Time
• Sequential information dissemination by packets
• Fast Gossiping by Short Messages
• Parallel Information Dissemination by Packets
• Routing permutations on graphs via matchings

This page was built for publication: Fast gossiping by short messages