On the robustness of interconnections in random graphs: a symbolic approach.
type: Item
instance of: scholarly article
title: On the robustness of interconnections in random graphs: a symbolic approach.
zbMATH Open document ID: 1061.05085
DOI: 10.1016/S0304-3975(01)00259-6
author: Philippe Flajolet
author: K. Hatzis
author: Sotiris E. Nikoletseas
author: P. G. Spirakis
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 1857035
describes a project that uses: gfun
describes a project that uses: OEIS
MaRDI profile type: Publication
cites work: Q3661894
cites work: Q4004078
cites work: Q4002919
cites work: Q3922713
cites work: Asymptotic Methods in Enumeration
cites work: Graphs as models of communication network vulnerability: Connectivity and persistence
cites work: Q3682518
cites work: Q3286850
cites work: Q4536423
cites work: Automatic average-case analysis of algorithms
cites work: A calculus for the random generation of labelled combinatorial structures
cites work: Q3669422
cites work: CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTS
cites work: Q4855565
cites work: Q3481743
cites work: GFUN
cites work: The On-Line Encyclopedia of Integer Sequences
cites work: Q3748279
cites work: A holonomic systems approach to special functions identities
full work available at URL: s0304-3975(01)00259-6
OpenAlex ID: W2028728677
description: scientific article; zbMATH DE number 1857035