Listing all the minimum spanning trees in an undirected graph (Q3066964)
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: Listing all the minimum spanning trees in an undirected graph |
scientific article; zbMATH DE number 5839344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Listing all the minimum spanning trees in an undirected graph |
scientific article; zbMATH DE number 5839344 |
Statements
Listing all the minimum spanning trees in an undirected graph (English)
0 references
20 January 2011
0 references
minimum spanning tree
0 references
enumeration algorithm
0 references
0.8387148380279541
0 references
0.8223320841789246
0 references
0.8142495155334473
0 references
0.8045998215675354
0 references
