Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below (Q3186835)
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: Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below |
scientific article |
Statements
Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below (English)
0 references
12 August 2016
0 references
spanning tree
0 references
polynomial algorithm
0 references
probabilistic analysis
0 references
performance estimate of an algorithm
0 references
asymptotic optimality
0 references
