On the robustness of interconnections in random graphs: a symbolic approach
Authors:
- P. FlajoletPFP. Flajolet
- K. HatzisKHK. Hatzis
- S. NikoletseasSNS. Nikoletseas
- P. SpirakisPSP. Spirakis
- 28 September 2002
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 287 (2) , 515-534
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A calculus for the random generation of labelled combinatorial structuresTheoretical Computer Science, 1994
- GFUNACM Transactions on Mathematical Software, 1994
- Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphsLecture Notes in Computer Science, 1993
- The birth of the giant componentRandom Structures & Algorithms, 1993
- Automatic average-case analysis of algorithmsTheoretical Computer Science, 1991
- A holonomic systems approach to special functions identitiesJournal of Computational and Applied Mathematics, 1990
- Graphs as models of communication network vulnerability: Connectivity and persistenceNetworks, 1981
- Asymptotic Methods in EnumerationSIAM Review, 1974