Minimum broadcast graphs

DOI10.1016/0012-365X(79)90022-0MaRDI QIDQ1256494zbMATH OpenFDO

Authors Andrzej Proskurowski, Arthur M. Farley, Stephen T. Hedetniemi, Sandra M. Hedetniemi

Publication date 1979

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(79)90022-0

zbMATH Keywords

Broadcast TimeCommunication LinesConnected Broadcast GraphMinimal Broadcast GraphMinimum Broadcast Graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Cites work

• scientific article; zbMATH DE number 3666695 (Why is no real title available?)
• scientific article; zbMATH DE number 3702701 (Why is no real title available?)
• Information Dissemination in Trees
• Minimal broadcast networks
• Minimum broadcast graphs

Cited in

(48)

• Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT)
• On linear-time data dissemination in dynamic rooted trees
• Binary linear programming models for robust broadcasting in communication networks
• Extremal broadcasting problems
• Tight lower bounds on broadcast function for n = 24 and 25
• The shortest path problem in the Knödel graph
• Broadcast graph is NP-complete
• A new construction of broadcast graphs
• Broadcasting from multiple originators
• Broadcasting with random faults
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• Some minimum broadcast graphs
• Sparse broadcast graphs
• Broadcasting in DMA-bound bounded degree graphs
• Minimum broadcast graphs
• Compound constructions of broadcast networks
• Bounded-call broadcasting
• Minimum \(k\)-broadcast graphs
• Time-relaxed broadcasting in communication networks
• A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS
• More broadcast graphs
• A survey on Knödel graphs.
• On the equality of the partial Grundy and upper ochromatic numbers of graphs
• Optimal and near-optimal broadcast in random graphs
• Broadcast schemes of hypercubes
• Diametral broadcast graphs
• The complexity of finding a broadcast center
• A new construction of broadcast graphs
• On the construction of regular minimal broadcast digraphs
• Graph theoretical issues in computer networks
• Efficient construction of broadcast graphs
• Efficient line broadcasting in a \(d\)-dimensional grid
• Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees
• Time-efficient broadcast in radio networks
• Bounds on broadcast time in well-connected graphs
• An algorithm for constructing minimal c-broadcast networks
• Source-oblivious broadcast
• Broadcasting multiple messages in a grid
• Sparse hypercube -- a minimal \(k\)-line broadcast graph.
• On broadcast schemes of Knödel graphs
• Minimum broadcast digraphs
• All sequential dimensional broadcast schemes in Knödel graphs
• Broadcasting in Trees with Multiple Originators
• Bounded depth broadcasting
• Tighter time bounds on fault-tolerant broadcasting and gossiping
• Upper bounds and approximation results for the \(k\)-slow burning problem
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• Minimum multiple originator broadcast graphs

This page was built for publication: Minimum broadcast graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1256494)