Analysis of edge deletion processes on faulty random regular graphs.

DOI10.1016/S0304-3975(02)00640-0zbMath1045.68103OpenAlexW2121524100MaRDI QIDQ1401301

Mike Molloy, Andreas Goerdt

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

zbMATH Keywords

Fault tolerance\(k\)-CoreRandom faultsRandom regular graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

The mixing time of the giant component of a random graph ⋮ Expansion properties of a random regular graph after random vertex deletions

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

This page was built for publication: Analysis of edge deletion processes on faulty random regular graphs.