Approximating unweighted connectivity problems in parallel
Information and Computation
Efficient distributed algorithm for correctly finding disjoint paths in wireless sensor networks
International Journal of Sensor Networks
Hi-index | 0.00 |
The use of highly expanding bipartite multigraphs (called dispersers) to reduce greatly the error of probabilistic algorithms at the cost of few additional random bits is treated. Explicit constructions of such graphs are generalized and used to obtain ...