The giant component threshold for random regular graphs with edge faults

DOI10.1007/BFB0029971MaRDI QIDQ4699304zbMATH OpenFDO

Authors Andreas Goerdt

Publication date 10 November 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0029971

zbMATH Keywords

multiprocessor architecturesstatic edge faults

Mathematics Subject Classification ID

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

Recommendations

• The giant component threshold for random regular graphs with edge faults H. Prodinger
• Connectivity properties in random regular graphs with edge faults
• Random regular graphs with edge faults: Expansion through cores
• Expander properties in random regular graphs with edge faults
• On the largest component of the random graph at a nearcritical stage
• Giant components in random graphs
• Giant component in random multipartite graphs with given degree sequences
• Almost Sure Fault Tolerance in Random Graphs
• scientific article; zbMATH DE number 6303023

Cited in

(8)

• Analysis of edge deletion processes on faulty random regular graphs.
• On the fault tolerance of the butterfly
• Analysis of edge deletion processes on faulty random regular graphs
• Expander properties in random regular graphs with edge faults
• Connectivity properties in random regular graphs with edge faults
• The giant component threshold for random regular graphs with edge faults H. Prodinger
• Random regular graphs with edge faults: Expansion through cores
• The effect of faults on network expansion

This page was built for publication: The giant component threshold for 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 Q4699304)