A characterization of kruskal sharing rules for minimum cost spanning tree problems (Q532655): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 91B32 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 5884705 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
minimum cost spanning tree problems | |||
| Property / zbMATH Keywords: minimum cost spanning tree problems / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Kruskal's algorithm | |||
| Property / zbMATH Keywords: Kruskal's algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sharing rules | |||
| Property / zbMATH Keywords: sharing rules / rank | |||
Normal rank | |||
Revision as of 09:13, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of kruskal sharing rules for minimum cost spanning tree problems |
scientific article |
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
