CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTS
From MaRDI portal
Publication:5249039
DOI10.1142/S0129054100000156zbMath1320.05114MaRDI QIDQ5249039
Krishna V. Palem, Mordechai M. Yung, Paul G. Spirakis, Sotiris E. Nikoletseas
Publication date: 29 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Related Items (4)
Expansion properties of a random regular graph after random vertex deletions ⋮ Interval routing in reliability networks ⋮ On the robustness of interconnections in random graphs: a symbolic approach. ⋮ Hamiltonicity of the Torus Network Under the Conditional Fault Model
Cites Work
- The asymptotic distribution of short cycles in random regular graphs
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Graphs as models of communication network vulnerability: Connectivity and persistence
- Network Flow and Testing Graph Connectivity
This page was built for publication: CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTS
