Munich Personal RePEc Archive

The folk solution and Boruvka's algorithm in minimum cost spanning tree problems

Bergantiños, Gustavo and Vidal-Puga, Juan (2009): The folk solution and Boruvka's algorithm in minimum cost spanning tree problems.

[img]
Preview
PDF
MPRA_paper_17839.pdf

Download (241Kb) | Preview

Abstract

The Boruvka's algorithm, which computes the 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.

UB_LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.