Bounded depth broadcasting

DOI10.1016/0166-218X(94)00165-AzbMath0849.05041OpenAlexW2056066741MaRDI QIDQ1917294

Joseph G. Peters, David B. Peters

Publication date: 5 November 1996

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

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00165-a

zbMATH Keywords

communicationbroadcast graphoptimal networksbroadcast timeminimum broadcast graphbroadcast treebroadcasting process

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items (2)

Methods and problems of communication in usual networks ⋮ Degree- and time-constrained broadcast networks

Cites Work

• Unnamed Item
• Sparse broadcast graphs
• Broadcasting in DMA-bound bounded degree graphs
• Minimum broadcast digraphs
• Minimum broadcast graphs
• Methods and problems of communication in usual networks
• A survey of gossiping and broadcasting in communication networks
• Minimal broadcast networks
• Information Dissemination in Trees
• Broadcasting in Bounded Degree Graphs
• Antepenultimate broadcasting

This page was built for publication: Bounded depth broadcasting