A characterization of kruskal sharing rules for minimum cost spanning tree problems (Q532655)
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: A characterization of kruskal sharing rules for minimum cost spanning tree problems |
scientific article; zbMATH DE number 5884705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of kruskal sharing rules for minimum cost spanning tree problems |
scientific article; zbMATH DE number 5884705 |
Statements
A characterization of kruskal sharing rules for minimum cost spanning tree problems (English)
0 references
5 May 2011
0 references
minimum cost spanning tree problems
0 references
Kruskal's algorithm
0 references
sharing rules
0 references
0.9088220000267028
0 references
0.8970888257026672
0 references
0.8788451552391052
0 references
0.8727015852928162
0 references
0.8431583046913147
0 references
