The minimum spanning tree and duality in graphs

Wim Pijls

No EI2013-14, Econometric Institute Research Papers from Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute

Abstract: Several 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.

Keywords: algorithms; duality (search for similar items in EconPapers)
Date: 2013-04-19
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://repub.eur.nl/pub/40236/EI2013-14.pdf (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:ems:eureir:40236

Access Statistics for this paper

More papers in Econometric Institute Research Papers from Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute Contact information at EDIRC.
Bibliographic data for series maintained by RePub ( this e-mail address is bad, please contact ).