The giant component threshold for random regular graphs with edge faults

Authors:
Andreas Goerdt
Affiliations:
TU Chemnitz, Chemnitz, Germany
Venue:
Theoretical Computer Science
Year:
2001

Citing 0
Cited 3

Analysis of edge deletion processes on faulty random regular graphs

Theoretical Computer Science - Latin American theoretical informatics
Araneola: A scalable reliable multicast system for dynamic environments

Journal of Parallel and Distributed Computing
Critical percolation on random regular graphs

Random Structures & Algorithms

Quantified Score

Hi-index	5.23

Visualization

Abstract