Minimum broadcast digraphs

DOI10.1016/0166-218X(92)90148-4MaRDI QIDQ1199444zbMATH OpenFDO

Authors Arthur L. Liestman, Joseph G. Peters

Publication date 16 January 1993

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(92)90148-4

zbMATH Keywords

Broadcastingcommunication networkdirected graphsinformation disseminationsparse graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Applications of graph theory to circuits and networks (94C15)

Recommendations

• On the structure of minimum broadcast digraphs
• A minimum broadcast graph on 26 vertices
• Sparse broadcast graphs
• scientific article; zbMATH DE number 1743971
• Broadcast Networks of Bounded Degree

Cites work

• A survey of gossiping and broadcasting in communication networks
• scientific article; zbMATH DE number 4141826 (Why is no real title available?)
• scientific article; zbMATH DE number 3702701 (Why is no real title available?)
• Minimal broadcast networks
• Minimum broadcast graphs
• Sparse broadcast graphs
• Tight Bounds on Mimimum Broadcast Networks

Cited in

(17)

• Minimum broadcast tree decompositions
• Sparse broadcast graphs
• Broadcasting and spanning trees in de Bruijn and Kautz networks
• Broadcasting in DMA-bound bounded degree graphs
• On the construction of regular minimal broadcast digraphs
• Methods and problems of communication in usual networks
• Minimum \(k\)-broadcast graphs
• Time-relaxed broadcasting in communication networks
• A survey on Knödel graphs.
• On the structure of minimum broadcast digraphs
• Hierarchical broadcast and gossip networks
• Bounded depth broadcasting
• A simple construction of broadcast graphs
• Minimal path broadcast networks
• scientific article; zbMATH DE number 1743971 (Why is no real title available?)
• Antepenultimate broadcasting
• Some minimum gossip graphs

This page was built for publication: Minimum broadcast digraphs

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