Minimum-time line broadcast networks
From MaRDI portal
Publication:3870643
Cited in
(22)- Broadcast and gossip in line-communication mode
- Efficient collective communciation in optical networks
- Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
- scientific article; zbMATH DE number 1985614 (Why is no real title available?)
- Line broadcasting in cycles
- Multiple routing strategies in a labelled network
- Minimum-cost line broadcast in paths
- Communication in the two-way listen-in vertex-disjoint paths mode
- A note on line broadcast in digraphs under the edge-disjoint paths mode
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem
- Length-constrained path-matchings in graphs
- Efficient line broadcasting in a \(d\)-dimensional grid
- Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees
- Gossiping in vertex-disjoint paths mode in interconnection networks
- Optimal algorithms for dissemination of information in generalized communication modes
- Sparse hypercube -- a minimal \(k\)-line broadcast graph.
- Gossiping in chordal rings under the line model
- Parameterized Complexity of Broadcasting in Graphs
- The relationship between gossiping in vertex-disjoint paths mode and bisection width
- Optimal algorithms for broadcast and gossip in the edge-disjoint modes
- The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width
- Toward a general theory of unicast-based multicast communication
This page was built for publication: Minimum-time line broadcast networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3870643)
