On the robustness of interconnections in random graphs: a symbolic approach.

DOI10.1016/S0304-3975(01)00259-6zbMath1061.05085OpenAlexW2028728677MaRDI QIDQ1853495

K. Hatzis, Philippe Flajolet, Paul G. Spirakis, Sotiris E. Nikoletseas

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00259-6

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10)

Related Items

The Random Connection Model on the Torus

Uses Software

• gfun
• OEIS

Cites Work

• A holonomic systems approach to special functions identities
• Automatic average-case analysis of algorithms
• A calculus for the random generation of labelled combinatorial structures
• Graphs as models of communication network vulnerability: Connectivity and persistence
• Asymptotic Methods in Enumeration
• GFUN
• CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item