Author:
Flajolet Philippe,Hatzis Kostas,Nikoletseas Sotiris,Spirakis Paul
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. N. Alon and J. Spencer, “The Probabilistic Method”, John Wiley & Sons, 1992.
2. D. Bauer, F. Boesch, C. Suffel and R. Tindell, “Connectivity extremal problems and the design of reliable probabilistic networks”, The Theory of Applications of Graphs, John Wiley and Sons, 1981.
3. F. T. Boesch, F. Harary and J. A. Cabell, “Graphs and models of communication networks vulnerability: connectivity and persistence”, Networks, vol. 11, pp. 57–63, 1981.
4. B. Bollobaś, “Random Graphs”, Academic Press, 1985.
5. A. Broder, A. Frieze, S. Suen and E. Upfal, “Optimal construction of edge-disjoint paths in random graphs”, SIAM Journal on Computing 28, 541–574. Also in the Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 603–612, 1994.