Random matching problems on the complete graph.
Wästlund, Johan (2008)
Electronic Communications in Probability [electronic only]
Similarity:
Displaying similar documents to “An easy proof of the limit in the random assignment problem.”
Random matching problems on the complete graph.
Encores on cores.
Cain, Julie, Wormald, Nicholas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On percolation in random graphs with given vertex degrees.
Janson, Svante (2009)
Electronic Journal of Probability [electronic only]
Similarity:
Large deviations in randomly coloured random graphs.
Biggins, J.D., Penman, D.B. (2009)
Electronic Communications in Probability [electronic only]
Similarity:
Perturbation theory for random walk in asymmetric random environment.
Conlon, Joseph G. (2005)
The New York Journal of Mathematics [electronic only]
Similarity:
The random linear bottleneck assignment problem
U. Pferschy (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
On randomly generated non-trivially intersecting hypergraphs.
Patkós, Balázs (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Constrainted graph processes.
Bolobás, Béla, Riordan, Oliver (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Coloring the edges of a random graph without a monochromatic giant component.
Spöhel, Reto, Steger, Angelika, Thomas, Henning (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Planarity thresholds for two types of random subgraphs of the -cube
Karin Mahrhold, Karl F. E. Weber (1989)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Continuity of the percolation threshold in randomly grown graphs.
Turova, Tatyana S. (2007)
Electronic Journal of Probability [electronic only]
Similarity: