Time bounds for broadcasting in bounded degree graphs
From MaRDI portal
Recommendations
Cited in
(20)- Broadcasting and spanning trees in de Bruijn and Kautz networks
- Broadcasting in DMA-bound bounded degree graphs
- Bounded-call broadcasting
- Methods and problems of communication in usual networks
- Broadcasting in butterfly and deBruijn networks
- The complexity of broadcasting in planar and decomposable graphs
- Sparse hypercube -- a minimal \(k\)-line broadcast graph.
- Broadcast time and connectivity
- Minimum average broadcast time in a graph of bounded degree.
- On the optimality of general lower bounds for broadcasting and gossiping
- An optimal family of directed, bounded-degree broadcast networks
- A tight upper bound on acquaintance time of graphs
- Broadcast Networks of Bounded Degree
- Broadcasting in Bounded Degree Graphs
- Degree- and time-constrained broadcast networks
- On the broadcast time of the butterfly network
- Broadcasting in butterfly and deBruijn networks (extended abstract)
- Approximation algorithms in graphs with known broadcast time of the base graph
- The minimum broadcast time problem for several processor networks
- On the runtime and robustness of randomized broadcasting
This page was built for publication: Time bounds for broadcasting in bounded degree graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4694740)