Tail bound for the minimal spanning tree of a complete graph. (Q1423115)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tail bound for the minimal spanning tree of a complete graph. |
scientific article; zbMATH DE number 2041586
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tail bound for the minimal spanning tree of a complete graph. |
scientific article; zbMATH DE number 2041586 |
Statements
Tail bound for the minimal spanning tree of a complete graph. (English)
0 references
14 February 2004
0 references
Minimal spanning tree
0 references
Large deviation
0 references
Martingale inequality
0 references
0 references
0.8688693046569824
0 references
0.8426292538642883
0 references
0.842322051525116
0 references
0.8409758806228638
0 references
