Revision as of 03:31, 12 April 2018 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,647 edits expand florek ref; fix weird ref footnote placement ← Previous edit		Revision as of 04:25, 12 April 2018 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,647 edits →top: given that he wrote in French, is there any evidence that Sollin lived in an English-speaking country or that this is what caused his name to rise to the top? Do we even know his first initial, or does M. stand for monsieur? Next edit →
Line 30: \| url = https://eudml.org/doc/209969 \| volume = 2 \| year = 1951}}</ref> and again by [[Sollin]] in 1965.<ref>{{cite journal \| last = Sollin \| first = M. \| authorlink = M. Sollin \| year = 1965 \| title = Le tracé de canalisation \| journal = Programming, Games, and Transportation Networks \| language = French }}</ref> ~~Because [[Sollin]] was the only computer scientist in this list living in an English speaking country, this~~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