Minimum broadcast graphs
From MaRDI portal
Publication:1256494
DOI10.1016/0012-365X(79)90022-0zbMath0404.05038MaRDI QIDQ1256494
Andrzej Proskurowski, Stephen T. Hedetniemi, Sandra M. Hedetniemi, Arthur M. Farley
Publication date: 1979
Published in: Discrete Mathematics (Search for Journal in Brave)
Broadcast TimeCommunication LinesConnected Broadcast GraphMinimal Broadcast GraphMinimum Broadcast Graphs
Related Items (41)
Binary linear programming models for robust broadcasting in communication networks ⋮ Bounded-call broadcasting ⋮ Minimum \(k\)-broadcast graphs ⋮ Some minimum broadcast graphs ⋮ Broadcasting multiple messages in a grid ⋮ Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees ⋮ The complexity of finding a broadcast center ⋮ Broadcasting with random faults ⋮ Bounded depth broadcasting ⋮ Extremal broadcasting problems ⋮ Tighter time bounds on fault-tolerant broadcasting and gossiping ⋮ 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 ⋮ On the equality of the partial Grundy and upper ochromatic numbers of graphs ⋮ More broadcast graphs ⋮ Optimal and near-optimal broadcast in random graphs ⋮ A survey on Knödel graphs. ⋮ Efficient construction of broadcast graphs ⋮ Diametral broadcast graphs ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ Sparse broadcast graphs ⋮ Minimum multiple originator broadcast graphs ⋮ An algorithm for constructing minimalc-broadcast networks ⋮ Broadcasting in DMA-bound bounded degree graphs ⋮ Minimum broadcast digraphs ⋮ Broadcasting from multiple originators ⋮ The shortest path problem in the Knödel graph ⋮ Efficient line broadcasting in a \(d\)-dimensional grid ⋮ A New Construction of Broadcast Graphs ⋮ Minimum broadcast graphs ⋮ Sparse hypercube -- a minimal \(k\)-line broadcast graph. ⋮ Time-Efficient Broadcast in Radio Networks ⋮ Compound constructions of broadcast networks ⋮ Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT) ⋮ Broadcasting in Trees with Multiple Originators ⋮ On the construction of regular minimal broadcast digraphs ⋮ Graph theoretical issues in computer networks
Cites Work
This page was built for publication: Minimum broadcast graphs
