An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem (Q1197938)
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: An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem |
scientific article; zbMATH DE number 92038
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem |
scientific article; zbMATH DE number 92038 |
Statements
An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem (English)
0 references
16 January 1993
0 references
one edge pass non-greedy algorithm
0 references
minimum spanning tree problem
0 references
network labeling
0 references
greedy algorithms
0 references
