Constrainted graph processes.
Bolobás, Béla, Riordan, Oliver (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “On random greedy triangle packing.”
Constrainted graph processes.
Real time asymptotic packing.
Spencer, Joel (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Recurrence of distributional limits of finite planar graphs.
Benjamini, Itai, Schramm, Oded (2001)
Electronic Journal of Probability [electronic only]
Similarity:
Maximum cardinality 1-restricted simple 2-matchings.
Hartvigsen, David (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On coverings of random graphs
Miklós Ajtai, J. Komlos, Vojtěch Rödl, Endre Szemerédi (1982)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Encores on cores.
Cain, Julie, Wormald, Nicholas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Using Lovász local lemma in the space of random injections.
Lu, Linyuan, Székely, László (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
An easy proof of the limit in the random assignment problem.
Wästlund, Johan (2009)
Electronic Communications in Probability [electronic only]
Similarity:
On randomly generated non-trivially intersecting hypergraphs.
Patkós, Balázs (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Generating a random sink-free orientation in quadratic time.
Cohn, Henry, Pemantle, Robin, Propp, James (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bootstrap percolation and diffusion in random graphs with given vertex degrees.
Amini, Hamed (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: