Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
419477 | Discrete Applied Mathematics | 2011 | 5 Pages |
Abstract
Boruvka’s algorithm, which computes a minimum cost spanning tree, is used to define a rule to share the cost among the nodes (agents). We show that this rule coincides with the folk solution, a very well-known rule of this literature.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Gustavo Bergantiños, Juan Vidal-Puga,