scientific article; zbMATH DE number 5730481

MaRDI QIDQ3574996zbMATH OpenFDO

Authors Louigi Addario-Berry, Nicolas Broutin, Bruce Reed

Publication date 5 July 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAG0116/0.html

zbMATH Keywords

Ballot theorembranching processesKruskal's algorithmminimum spanning treesrandom graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On the minimum diameter spanning tree problem
• On the diameters of spanning trees
• Minimum Diameter Spanning Trees and Related Problems
• Finding bounded diameter minimum spanning tree in general graphs
• The diameter of the uniform spanning tree of dense graphs
• Minimum spanning trees in d dimensions
• scientific article; zbMATH DE number 1436136
• The scaling limit of the minimum spanning tree of the complete graph
• Diameter and treewidth in minor-closed graph families

Cited in

(7)

• Long paths in first passage percolation on the complete graph. I: Local PWIT dynamics
• Weak disorder asymptotics in the stochastic mean-field model of distance
• The continuum limit of critical random graphs
• Critical random graphs and the structure of a minimum spanning tree
• Depth functions and mutidimensional medians on minimal spanning trees
• The diameter of the uniform spanning tree of dense graphs
• Note on the structure of Kruskal's algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3574996)