Publication:4140369
From MaRDI portal
zbMath0365.68034MaRDI QIDQ4140369
Publication date: 1976
Related Items
Unnamed Item, A class of algorithms which require nonlinear time to maintain disjoint sets, Analysis of a drop-push model for percolation and coagulation, Note on the structure of Kruskal's algorithm, Applications of the theory of records in the study of random trees, Linear expected time of a simple union-find algorithm, A probabilistic minimum spanning tree algorithm, The expected linearity of a simple equivalence algorithm, Coalescent random forests, The standard additive coalescent, Normal convergence problem? Two moments and a recurrence may be the clues, Stochastic coalescence in logarithmic time