1 problem

Square-root upper-bound conjecture for the synchronous-to-asynchronous guaranteed spreading ratio
Synchronous-to-asynchronous ratio conjecture. For any $n$ -vertex graph $G$ ,
opendistributed-computing probabilistic-combinatorics rumour-spreading
0 responses
03