Comments on broadcast algorithms for two-dimensional grids

DOI10.1016/S0167-8191(05)80023-7MaRDI QIDQ758185zbMATH OpenFDO

Authors Martin Simmen

Publication date 1991

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-8191(05)80023-7

zbMATH Keywords

broadcast algorithmscommunicationsmulticomputerstwo-dimensional grids

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1156592
• Efficient line broadcasting in a \(d\)-dimensional grid
• On broadcasting multiple messages in a \(d\)-dimensional grid
• Broadcasting in m-dimensional grid graphs with a given neighborhood template
• scientific article; zbMATH DE number 3869385
• scientific article; zbMATH DE number 1161385
• 2-limited broadcast domination on grid graphs
• A broadcasting algorithm on the arrangement graph
• Optimal \((t, r)\) broadcasts on the infinite grid
• Asymptotically Optimal Bounds for (t,2) Broadcast Domination on Finite Grids

Cited in

(3)

• Homogeneous 2-hop broadcast in 2D
• Methods and problems of communication in usual networks
• Efficient line broadcasting in a \(d\)-dimensional grid

This page was built for publication: Comments on broadcast algorithms for two-dimensional grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q758185)