Talk:Borůvka's algorithm: Difference between revisions

Revision as of 13:58, 12 October 2010

Revision as of 15:10, 12 October 2010

Line 11:

This page refers the original papers by Otakar Borůvka and Gustave Choquet, but lacks references to the paper by

Florek, Łukasiewicz, Perkal, Steinhaus, and Zubrzycki and the paper by Sollin. Also, it is mentioned its use in parallel computing but there is not a reference to who first implemented in in parallel or any papers about parallel implementations.

---- <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Rps|Rps]] ([[User talk:Rps|talk]] • [[Special:Contributions/Rps|contribs]]) 13:57, 12 October 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot-->

I found the references:

[17] K. Florek, J. Łukaszewicz, H. Perkal, H. Steinhaus and S. Zubrzycki, Sur la liaison et la division des points d’un ensemble fini, Colloquium Mathematicum 2 (1951), pp. 282–285.

[18] M. Sollin, Le trace de canalisation. In: C. Berge and A. Ghouilla-Houri, Editors, Programming, Games, and Transportation Networks, Wiley, New York (1965) (in French).

Found in "The saga of minimum spanning trees" by Martin Mareš, available from [http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B8JDG-4TVR2H2-1&_user=2459680&_origUdi=B6WH3-4D7JN2B-3W&_fmt=high&_coverDate=12%2F31%2F2008&_rdoc=1&_orig=article&_origin=article&_zone=related_art&_acct=C000057391&_version=1&_urlVersion=0&_userid=2459680&md5=5b7d453d6f8b83f1ce83a62c4ee023dd#bibl001 http://www.sciencedirect.com/] .

Still lacks references to parallel implementations. I found the paper: "A parallel algorithm for constructing minimum spanning trees" by Jon Louis Bentley, Journal of Algorithms Volume 1, Issue 1, March 1980, Pages 51-59, but it seems to be about an alternative or improvement to the Sollin algorithm, not its parallel implementation.

[[User:Rps|Rps]] ([[User talk:Rps|talk]]) 15:10, 12 October 2010 (UTC)

----

Note that Otakar Boruvka's name should really be spelled with a special character, but this is not one of the standard ones on the typewriter keyboard, nor is it in the HTML special character set. The u should have a small circle over the top - equivalent to &uring; - if that were valid HTML, which it is not!