On the structure of minimum broadcast digraphs

DOI10.1016/S0304-3975(99)00282-0MaRDI QIDQ1575743zbMATH OpenOpenAlexFDO

Authors 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

broadcastingdirected graphsnetworks

Mathematics Subject Classification ID

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

Recommendations

• Minimum broadcast digraphs
• scientific article; zbMATH DE number 1743971
• On the construction of regular minimal broadcast digraphs
• Sparse broadcast graphs

Cites work

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

Cited in

(6)

• Minimum broadcast tree decompositions
• Minimum broadcast digraphs
• On the construction of regular minimal broadcast digraphs
• Minimum \(k\)-broadcast graphs
• A survey on Knödel graphs.
• scientific article; zbMATH DE number 1743971 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575743)