The giant component threshold for random regular graphs with edge faults H. Prodinger
From MaRDI portal
Publication:5941282
DOI10.1016/S0304-3975(00)00015-3zbMath0973.68186MaRDI QIDQ5941282
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
Related Items
Critical percolation on random regular graphs, Random 2-SAT: Results and problems, Araneola: a scalable reliable multicast system for dynamic environments, Analysis of edge deletion processes on faulty random regular graphs., An old approach to the giant component problem, Critical percolation on random regular graphs
Cites Work
- The isoperimetric number of random regular graphs
- The critical probability of bond percolation on the square lattice equals 1/2
- The longest path in a random graph
- Largest random component of a k-cube
- On the fault tolerance of the butterfly
- Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item