Borůvka's algorithm: Difference between revisions

Content deleted Content added
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?
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
Line 30:
| url = https://eudml.org/doc/209969
| volume = 2
| year = 1951}}</ref> and again by George Sollin in 1965.<ref>{{cite journal | last = Sollin | first = M. | authorlink = M. SollinGeorge | 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.