Concepedia
COMBINATORICA · 1998 · 64 citations · 9 references
Natural SciencesComputer ScienceMathematicsCombinatoricsTopologyGraph AlgorithmsGraph TheoryProbabilistic CombinatoricsMinimum Spanning Tree ProblemRandom Graph TheoryRandom GraphsRandom Regular GraphsRandom Trees
9
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
Robert E. Odeh, Donald E. Knuth · Journal of the American Statistical Association · 1969 · 2.6K citations
Computing, Computer Science, Algorithms +9
Concentration of measure and isoperimetric inequalities in product spaces
Michel Talagrand · Publications mathématiques de l IHÉS · 1995 · 862 citations
Natural Sciences, Mathematics, Probability Theory +12
On the value of a random minimum spanning tree problem
Alan Frieze · Discrete Applied Mathematics · 1985 · 230 citations
Natural Sciences, Computer Science, Mathematics +8
Asymptotic enumeration by degree sequence of graphs with degreeso(n 1/2)
Brendan D. McKay, Nicholas Wormald · COMBINATORICA · 1991 · 205 citations
Natural Sciences, Computer Science, Mathematics +11
The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
Svante Janson · Random Structures and Algorithms · 1995 · 73 citations
Natural Sciences, Computer Science, Computer Networks +9