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

Gustavo Bergantiños and Juan Vidal-Puga

MPRA Paper from University Library of Munich, Germany

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.

Keywords: minimum cost spanning tree; Boruvka's algorithm; folk solution (search for similar items in EconPapers)
JEL-codes: C7 (search for similar items in EconPapers)
Date: 2009-10-13
New Economics Papers: this item is included in nep-gth
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/17839/1/MPRA_paper_17839.pdf original version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:17839

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().