Expander properties in random regular graphs with edge faults
From MaRDI portal
Publication:4596641
DOI10.1007/3-540-59042-0_93zbMATH Open1379.68259OpenAlexW1567122189MaRDI QIDQ4596641FDOQ4596641
Sotiris E. Nikoletseas, P. G. Spirakis
Publication date: 4 December 2017
Published in: STACS 95 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59042-0_93
Recommendations
- Random regular graphs with edge faults: Expansion through cores
- Expansion properties of a random regular graph after random vertex deletions
- Analysis of edge deletion processes on faulty random regular graphs.
- The giant component threshold for random regular graphs with edge faults H. Prodinger
- scientific article; zbMATH DE number 1361486
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cited In (12)
- Expander properties and the cover time of random intersection graphs
- The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
- Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time
- The effect of faults on network expansion
- The giant component threshold for random regular graphs with edge faults H. Prodinger
- Vertex percolation on expander graphs
- Large independent sets in general random intersection graphs
- Title not available (Why is that?)
- Random regular graphs with edge faults: Expansion through cores
- Expansion properties of a random regular graph after random vertex deletions
- Interval routing in reliability networks
- Analysis of edge deletion processes on faulty random regular graphs.
This page was built for publication: Expander properties in random regular graphs with edge faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596641)