Information Dissemination in Trees
From MaRDI portal
Recommendations
Cited in
(78)- A linear algorithm for finding the k‐broadcast center of a tree
- 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
- Minimum-time multidrop broadcast
- The minimum broadcast time problem for several processor networks
- Biased random-key genetic algorithms for the weighted minimum broadcast time problem
- The Push Tree problem
- Broadcast graph is NP-complete
- The optimal structure of information dissemination
- Trade-offs between the size of advice and broadcasting time in trees
- Local broadcasting in a tree under minisum criterion
- Diameter of General Knödel Graphs
- \textsc{Telephone Broadcast} on graphs of treewidth two
- Nondiscriminatory propagation on trees
- Time efficient centralized gossiping in radio networks
- A minimum broadcast graph on 26 vertices
- Nonadaptive broadcasting in trees
- Broadcasting from multiple originators
- On the number of broadcast schemes in networks
- Parallel algorithms for gossiping by mail
- Finding broadcast 2-centers of a tree under the postal model
- More general parallel tree contraction: Register allocation and broadcasting in a tree
- Minimum broadcast graphs
- Compound constructions of broadcast networks
- The broadcast function value \(B(23)\) is \(33\) or \(34\).
- Bounded-call broadcasting
- Time-relaxed broadcasting in communication networks
- Asymptotically optimal gossiping in radio networks
- Minimizing broadcast costs under edge reductions in tree networks
- The minimum degree group Steiner problem
- Broadcasting in stars of cliques
- Improved approximation for broadcasting in k-path graphs
- Data transmission in processor networks
- Strong bounds and exact solutions to the minimum broadcast time problem
- Information dissemination in weighted trees
- Traffic-light scheduling on the grid
- Broadcast schemes of hypercubes
- The multiple originator broadcasting problem in graphs
- The complexity of finding a broadcast center
- Graph theoretical issues in computer networks
- On the complexity of the shortest-path broadcast problem
- Bounds on broadcast time in well-connected graphs
- An algorithm for constructing minimal c-broadcast networks
- Broadcasting in general networks I: Trees
- Source-oblivious broadcast
- A linear-time optimal broadcasting algorithm in stars of cliques
- The complexity of broadcasting in planar and decomposable graphs
- The complexity of broadcasting in planar and decomposable graphs
- Broadcasting multiple messages in a grid
- scientific article; zbMATH DE number 2151257 (Why is no real title available?)
- Gossips and telegraphs
- Broadcasting in split graphs
- The broadcast median problem in heterogeneous postal model
- New upper bound on m-time-relaxed k-broadcast graphs
- Parameterized Complexity of Broadcasting in Graphs
- Broadcasting and spanning trees in de Bruijn and Kautz networks
- Broadcasting and three list subtraction
- Broadcasting two messages in wheel graphs
- Broadcasting in Trees with Multiple Originators
- Approximation algorithms in graphs with known broadcast time of the base graph
- Bounded depth broadcasting
- Minimal broadcast networks
- Set to set broadcasting in communication networks
- Broadcasting on cactus graphs
- Upper bounds and approximation results for the \(k\)-slow burning problem
- A class of solutions to the gossip problem. I
- Broadcasting on \([0,L]\)
- A note to non-adaptive broadcasting
- Asynchronous broadcasting with bivalent beeps
- Efficient broadcast trees for weighted vertices
- The complexity of detecting crossingfree configurations in the plane
- Broadcasting in weighted trees under the postal model
- Bounded Degree Group Steiner Tree Problems
- More general parallel tree contraction: register allocation and broadcasting in a tree
- On broadcasting in unicyclic graphs
- Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
This page was built for publication: Information Dissemination in Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922180)
