Extremal bounds for probabilistic polling in graphs

Yehuda Hassin, David Peleg. Extremal bounds for probabilistic polling in graphs. In Michele Flammini, Enrico Nardelli, Guido Proietti, Paul G. Spirakis, editors, SIROCCO 7, Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, Laquila, Italy, June 20-22, 2000. pages 167-180, Carleton Scientific, 2000.

Abstract

Abstract is missing.