Parallel algorithms for minimum spanning trees: Difference between revisions

Content deleted Content added

Revision as of 00:04, 31 July 2023 edit 2600:4041:4ab:a900:99aa:65fe:1187:51ea (talk) minor type in pseudocode correction ← Previous edit		Latest revision as of 05:49, 3 August 2025 edit undo InternetArchiveBot (talk \| contribs) Bots, Pending changes reviewers 5,670,452 edits Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.5
(2 intermediate revisions by 2 users not shown)
Line 220: Another challenge is the External Memory model - there is a proposed algorithm due to Dementiev et al. that is claimed to be only two to five times slower than an algorithm that only makes use of internal memory<ref>{{citation \| last1 = Dementiev \| first1 = Roman \| last2 = Sanders \| first2 = Peter \| last3 = Schultes \| first3 = Dominik \| last4 = Sibeyn \| first4 = Jop F. \| contribution = Engineering an external memory minimum spanning tree algorithm \| pages = 195–208 \| title = Proc. IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004) \| url = http://algo2.iti.kit.edu/dementiev/files/emst.pdf \| year = 2004~~}}.</ref>~~ \| access-date = 2019-05-24 \| archive-date = 2011-08-09 \| archive-url = https://web.archive.org/web/20110809075049/http://algo2.iti.kit.edu/dementiev/files/emst.pdf \| url-status = dead }}.</ref> == References ==