An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem

From MaRDI portal

An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=An_%5C(O(%5Clog_m)%5C)_parallel_algorithm_for_the_minimum_spanning_tree_problem&oldid=66353502"