A fair rule in minimum cost spanning tree problems (Q2469848)
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 fair rule in minimum cost spanning tree problems |
scientific article; zbMATH DE number 5234485
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fair rule in minimum cost spanning tree problems |
scientific article; zbMATH DE number 5234485 |
Statements
A fair rule in minimum cost spanning tree problems (English)
0 references
11 February 2008
0 references
spanning tree
0 references
cost allocation
0 references
monotonicity
0 references
0.9186508
0 references
0.91580665
0 references
0.91524965
0 references
0.9118758
0 references
0.9111119
0 references
0.9090965
0 references
0 references
0.90464777
0 references
0.9032193
0 references
