Information Dissemination in Trees
From MaRDI portal
Publication:3922180
DOI10.1137/0210052zbMath0468.68064OpenAlexW2010178885WikidataQ60307047 ScholiaQ60307047MaRDI QIDQ3922180
E. J. Cockayne, Stephen T. Hedetniemi, Peter J. Slater
Publication date: 1981
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0210052
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)
Related Items (53)
Binary linear programming models for robust broadcasting in communication networks ⋮ Bounded Degree Group Steiner Tree Problems ⋮ The multiple originator broadcasting problem in graphs ⋮ Bounded-call broadcasting ⋮ Traffic-light scheduling on the grid ⋮ Broadcasting on \([0,L\)] ⋮ Broadcasting multiple messages in a grid ⋮ On the number of broadcast schemes in networks ⋮ Asymptotically optimal gossiping in radio networks ⋮ Time efficient centralized gossiping in radio networks ⋮ The complexity of finding a broadcast center ⋮ Bounded depth broadcasting ⋮ Extremal broadcasting problems ⋮ Minimum-time multidrop broadcast ⋮ The complexity of broadcasting in planar and decomposable graphs ⋮ Time-relaxed broadcasting in communication networks ⋮ Broadcasting in split graphs ⋮ Data transmission in processor networks ⋮ Broadcasting in general networks I: Trees ⋮ Approximation algorithms in graphs with known broadcast time of the base graph ⋮ On the complexity of the shortest-path broadcast problem ⋮ Diameter of General Knödel Graphs ⋮ Parallel algorithms for gossiping by mail ⋮ The broadcast median problem in heterogeneous postal model ⋮ A class of solutions to the gossip problem. I ⋮ The minimum broadcast time problem for several processor networks ⋮ Broadcasting on cactus graphs ⋮ Efficient broadcast trees for weighted vertices ⋮ An algorithm for constructing minimalc-broadcast networks ⋮ Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 ⋮ Broadcasting and spanning trees in de Bruijn and Kautz networks ⋮ The complexity of broadcasting in planar and decomposable graphs ⋮ Set to set broadcasting in communication networks ⋮ Broadcasting from multiple originators ⋮ Trade-offs between the size of advice and broadcasting time in trees ⋮ Minimal broadcast networks ⋮ A minimum broadcast graph on 26 vertices ⋮ A linear algorithm for finding the k‐broadcast center of a tree ⋮ Broadcasting in weighted trees under the postal model ⋮ Minimum broadcast graphs ⋮ Gossips and telegraphs ⋮ Nonadaptive broadcasting in trees ⋮ More general parallel tree contraction: Register allocation and broadcasting in a tree ⋮ The minimum degree group Steiner problem ⋮ On broadcasting in unicyclic graphs ⋮ Asynchronous Broadcasting with Bivalent Beeps ⋮ Minimizing broadcast costs under edge reductions in tree networks ⋮ The broadcast function value \(B(23)\) is \(33\) or \(34\). ⋮ Compound constructions of broadcast networks ⋮ Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT) ⋮ Broadcasting in Trees with Multiple Originators ⋮ The complexity of detecting crossingfree configurations in the plane ⋮ Graph theoretical issues in computer networks
This page was built for publication: Information Dissemination in Trees
