Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing

DOI10.1016/S0167-8191(02)00075-3zbMath0995.68184OpenAlexW1979750750MaRDI QIDQ1605472

Petr Salinger, Pavel Tvrdík

Publication date: 15 July 2002

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(02)00075-3

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Feedback vertex sets in mesh-based networks

This page was built for publication: Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing