A new algorithm for minimum spanning tree using depth-first-search in an undirected graph (Q4876371)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 872763
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for minimum spanning tree using depth-first-search in an undirected graph |
scientific article; zbMATH DE number 872763 |
Statements
A new algorithm for minimum spanning tree using depth-first-search in an undirected graph (English)
0 references
1 May 1996
0 references
minimum spanning tree
0 references
0.8182334303855896
0 references
0.8089432120323181
0 references
0.808268666267395
0 references
0.8035926222801208
0 references
