Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

ALGORITHMICA
2010

favoriteEmaildiscussreport

147views more ALGORITHMICA 2010»

Note on the Structure of Kruskal's Algorithm

13 years 4 months ago

Note on the Structure of Kruskal's Algorithm

Download www.cs.mcgill.ca

We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph on n vertices lying in [0, 1]d , and edge set weighted with the Euclidean distance. The height of the binary tree explaining the merging process is proved to be (n) on average. On the way to the proof, we obtain similar results for the complete graph and the d-dimensional square lattice with i.i.d. edge weights. Keywords and phrases: Random trees, Minimum spanning tree, Kruskal, height, random graphs, percolation.

Nicolas Broutin, Luc Devroye, Erin McLeish

Real-time Traffic

ALGORITHMICA 2010 | Complete Graph | Euclidean Distance | Random Graphs |

claim paper

Related Content

» Transductive Rademacher Complexities for Learning Over a Graph

» A note on the nearest neighbor in growthrestricted metrics

» Forest Density Estimation

» Further Observations on the Structure of the AES Algorithm

» A Note on Principal Point Estimability

» A Note on Point Location in Delaunay Triangulations of Random Points

» Grouping Text Lines in Freeform Handwritten Notes

» A Note on Some Applications of Interval Arithmetic in Hierarchical Solid Modeling

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2010
Where	ALGORITHMICA
Authors	Nicolas Broutin, Luc Devroye, Erin McLeish

Comments (0)