Title of article
The folk solution and Boruvka’s algorithm in minimum cost spanning tree problems
Author/Authors
Gustavo Berganti?os، نويسنده , , Juan Vidal-Puga، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
5
From page
1279
To page
1283
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
Minimum cost spanning tree , Boruvka’s algorithm , Folk solution
Journal title
Discrete Applied Mathematics
Serial Year
2011
Journal title
Discrete Applied Mathematics
Record number
887675
Link To Document