On broadcasting multiple messages in a d-dimensional grid
From MaRDI portal
Publication:1363774
DOI10.1016/S0166-218X(97)89163-9zbMATH Open0887.68051OpenAlexW2148355009MaRDI QIDQ1363774FDOQ1363774
Authors: Yehuda Roditty, B. Shoham
Publication date: 11 August 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Recommendations
Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)
Cites Work
Cited In (6)
- Comments on broadcast algorithms for two-dimensional grids
- Efficient line broadcasting in a \(d\)-dimensional grid
- Broadcasting multiple messages in a grid
- New upper bound on \(m\)-time-relaxed \(k\)-broadcast graphs
- Broadcasting multiple messages in the 1-in port model in optimal time
- Transmitting in the \(n\)-dimensional cube
This page was built for publication: On broadcasting multiple messages in a \(d\)-dimensional grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363774)