The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width

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

Theoretical Computer Science

A survey of graph layout problems

ACM Computing Surveys (CSUR)

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

Random walks and bisections in random circulant graphs

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics