Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Bau, Sheng
Wormald, Nicholas C.
and
Zhou, Sanming
2002.
Decycling numbers of random regular graphs.
Random Structures & Algorithms,
Vol. 21,
Issue. 3-4,
p.
397.
Cannings, C.
and
Penman, D.B.
2003.
Stochastic Processes: Modelling and Simulation.
Vol. 21,
Issue. ,
p.
51.
Kang, Mihyun
Koh, Youngmee
Ree, Sangwook
and
Łuczak, Tomasz
2006.
The connectivity threshold for the min‐degree random graph process.
Random Structures & Algorithms,
Vol. 29,
Issue. 1,
p.
105.
Kang, Mihyun
2007.
Evolution of random graph processes with degree constraints.
Electronic Notes in Discrete Mathematics,
Vol. 28,
Issue. ,
p.
493.
Kang, Mihyun
and
Seierstad, Taral Guldahl
2007.
Phase transition of the minimum degree random multigraph process.
Random Structures & Algorithms,
Vol. 31,
Issue. 3,
p.
330.
Telcs, András
Wormald, Nicholas
and
Zhou, Sanming
2007.
Hamiltonicity of random graphs produced by 2‐processes.
Random Structures & Algorithms,
Vol. 31,
Issue. 4,
p.
450.
Bridgewater, Jesse
Boykin, P. Oscar
and
Roychowdhury, Vwani
2007.
Balanced Overlay Networks (BON): An Overlay Technology for Decentralized Load Balancing.
IEEE Transactions on Parallel and Distributed Systems,
Vol. 18,
Issue. 8,
p.
1122.
Bollobás, Béla
and
Riordan, Oliver
2008.
Handbook of Large-Scale Random Networks.
Vol. 18,
Issue. ,
p.
15.
Coja-Oghlan, Amin
and
Kang, Mihyun
2009.
The evolution of the min–min random graph process.
Discrete Mathematics,
Vol. 309,
Issue. 13,
p.
4527.
Seierstad, Taral Guldahl
2013.
On the normality of giant components.
Random Structures & Algorithms,
Vol. 43,
Issue. 4,
p.
452.
Ben‐Eliezer, Omri
Hefetz, Dan
Kronenberg, Gal
Parczyk, Olaf
Shikhelman, Clara
and
Stojaković, Miloš
2020.
Semi‐random graph process.
Random Structures & Algorithms,
Vol. 56,
Issue. 3,
p.
648.