Sparse broadcast graphs

DOI10.1016/0166-218X(92)90226-ZzbMath0764.05042OpenAlexW2013324750MaRDI QIDQ1192945

Joseph G. Peters, Pavol Hell, Arthur L. Liestman, Jean-Claude Bermond

Publication date: 27 September 1992

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

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90226-z

zbMATH Keywords

networksminimum broadcast graphssparse broadcast graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of graph theory to circuits and networks (94C15)

Related Items (30)

Binary linear programming models for robust broadcasting in communication networks ⋮ Bounded-call broadcasting ⋮ Minimum \(k\)-broadcast graphs ⋮ A minimum broadcast graph on 63 vertices ⋮ Some minimum broadcast graphs ⋮ Degree- and time-constrained broadcast networks ⋮ On the number of broadcast schemes in networks ⋮ The complexity of finding a broadcast center ⋮ Bounded depth broadcasting ⋮ A new construction of broadcast graphs ⋮ Time-relaxed broadcasting in communication networks ⋮ Tight lower bounds on broadcast function for \(n = 24\) and 25 ⋮ A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS ⋮ Broadcast graphs using new dimensional broadcast schemes for Knödel graphs ⋮ Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs ⋮ Upper bounds on the broadcast function using minimum dominating sets ⋮ More broadcast graphs ⋮ Efficient construction of broadcast graphs ⋮ Diametral broadcast graphs ⋮ Broadcasting and spanning trees in de Bruijn and Kautz networks ⋮ Broadcasting in DMA-bound bounded degree graphs ⋮ Minimum broadcast digraphs ⋮ Broadcasting from multiple originators ⋮ A 1-relaxed minimum broadcast graph on 15 vertices. ⋮ A New Construction of Broadcast Graphs ⋮ Sparse hypercube -- a minimal \(k\)-line broadcast graph. ⋮ The even adjacency split problem for graphs ⋮ Compound constructions of broadcast networks ⋮ Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT) ⋮ Graph theoretical issues in computer networks

Cites Work

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

This page was built for publication: Sparse broadcast graphs