Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs

Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks

IEEE Transactions on Parallel and Distributed Systems

Gossiping in chordal rings under the line model

Theoretical Computer Science

Communication in the two-way listen-in vertex-disjoint paths mode

Theoretical Computer Science

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

Parallel Computing

Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms

Lower bounds on systolic gossip

Information and Computation

Lower bounds on systolic gossip

Information and Computation