On the structure of minimum broadcast digraphs

DOI10.1016/S0304-3975(99)00282-0zbMath0948.68132OpenAlexW1966326592MaRDI QIDQ1575743

Guillaume Fertin

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00282-0

zbMATH Keywords

networksdirected graphsbroadcasting

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12)

Related Items (1)

A survey on Knödel graphs.

Cites Work

• Minimum broadcast digraphs
• New gossips and telephones
• On the construction of regular minimal broadcast digraphs
• Lower bounds for the size in four families of minimum broadcast graphs
• Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
• A survey of gossiping and broadcasting in communication networks
• Antepenultimate broadcasting
• Tight Bounds on Mimimum Broadcast Networks

This page was built for publication: On the structure of minimum broadcast digraphs