Time-relaxed broadcasting in communication networks

DOI10.1016/S0166-218X(97)00114-5zbMath0917.90122WikidataQ126297273 ScholiaQ126297273MaRDI QIDQ1392539

Aditya Shastri

Publication date: 30 May 1999

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

zbMATH Keywords

minimum broadcast graphstime-relaxed broadcast graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Applications of graph theory to circuits and networks (94C15)

Related Items

Binary linear programming models for robust broadcasting in communication networks, Tight lower bounds on broadcast function for \(n = 24\) and 25, Broadcasting in general networks I: Trees, A 1-relaxed minimum broadcast graph on 15 vertices., On time-relaxed broadcasting networks, Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT)

Cites Work

• Unnamed Item
• Unnamed Item
• Sparse broadcast graphs
• Minimum broadcast graphs
• Fault-tolerant broadcast graphs
• On the construction of minimal broadcast networks
• Minimal broadcast networks
• Information Dissemination in Trees
• Antepenultimate broadcasting
• Tight Bounds on Mimimum Broadcast Networks
• A new method for constructing minimal broadcast networks