Communication in the two-way listen-in vertex-disjoint paths mode
Theoretical Computer Science
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
Random walks and bisections in random circulant graphs
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Hi-index | 0.00 |