The expected complexity of Prim's minimum spanning tree algorithm (Q1603503)
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: The expected complexity of Prim's minimum spanning tree algorithm |
scientific article; zbMATH DE number 1767408
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The expected complexity of Prim's minimum spanning tree algorithm |
scientific article; zbMATH DE number 1767408 |
Statements
The expected complexity of Prim's minimum spanning tree algorithm (English)
0 references
14 July 2002
0 references
graph algorithms
0 references
data structures
0 references
minimum spanning tree
0 references
expected performance
0 references
0 references
