Minimum broadcast digraphs

DOI10.1016/0166-218X(92)90148-4zbMath0755.94019MaRDI QIDQ1199444

Joseph G. Peters, Arthur L. Liestman

Publication date: 16 January 1993

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

zbMATH Keywords

directed graphscommunication networksparse graphsinformation disseminationBroadcasting

Mathematics Subject Classification ID

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

Related Items (8)

Methods and problems of communication in usual networks ⋮ Minimum \(k\)-broadcast graphs ⋮ Bounded depth broadcasting ⋮ A survey on Knödel graphs. ⋮ Broadcasting and spanning trees in de Bruijn and Kautz networks ⋮ Broadcasting in DMA-bound bounded degree graphs ⋮ On the structure of minimum broadcast digraphs ⋮ Hierarchical broadcast and gossip networks

Cites Work

• Unnamed Item
• Unnamed Item
• Sparse broadcast graphs
• Minimum broadcast graphs
• A survey of gossiping and broadcasting in communication networks
• Minimal broadcast networks
• Tight Bounds on Mimimum Broadcast Networks

This page was built for publication: Minimum broadcast digraphs