Revision as of 04:44, 12 April 2018 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,633 edits In fact it appears to be that he was a Frenchman named Georges Sollin; see e.g. https://books.google.com/books?id=rmYpBgAAQBAJ&pg=PA169 ← Previous edit		Revision as of 04:45, 12 April 2018 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,633 edits or actually I think Georges Next edit →
Line 30: \| url = https://eudml.org/doc/209969 \| volume = 2 \| year = 1951}}</ref> and again by ~~George~~Georges Sollin in 1965.<ref>{{cite journal \| last = Sollin \| first = ~~George~~Georges \| year = 1965 \| title = Le tracé de canalisation \| journal = Programming, Games, and Transportation Networks \| language = French }}</ref> This algorithm is frequently called '''Sollin's algorithm''', especially in the [[parallel computing]] literature. The algorithm begins by finding the minimum-weight edge incident to each vertex of the graph, and adding all of those edges to the forest.

Borůvka's algorithm: Difference between revisions