The minimum spanning tree and duality in graphs
AbstractSeveral algorithms for the minimum spanning tree are known. The Blue-red algorithm is a generic algorithm in this field. A new proof for this algorithm is presented, based upon the duality of circuits and cuts in a graph.The Blue-red algorithm is genetic, because the other algorithms can be regarded as special instances. This is shown using the same duality.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Erasmus University Rotterdam, Econometric Institute in its series Econometric Institute Report with number EI2013-14.
Date of creation: 19 Apr 2013
Date of revision:
Contact details of provider:
Web page: http://www.few.eur.nl/few
This paper has been announced in the following NEP Reports:
- NEP-ALL-2013-06-04 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Anneke Kop).
If references are entirely missing, you can add them using this form.