Analysis of edge deletion processes on faulty random regular graphs.
From MaRDI portal
Publication:1401301
DOI10.1016/S0304-3975(02)00640-0zbMath1045.68103MaRDI QIDQ1401301
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00640-0
68R10: Graph theory (including graph drawing) in computer science
Related Items
Expansion properties of a random regular graph after random vertex deletions, The mixing time of the giant component of a random graph
Cites Work
- The isoperimetric number of random regular graphs
- Sudden emergence of a giant \(k\)-core in a random graph
- Expander properties in random regular graphs with edge faults
- Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing
- The giant component threshold for random regular graphs with edge faults H. Prodinger
- Random regular graphs with edge faults: Expansion through cores
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item