An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
From MaRDI portal
Publication:1218265
DOI10.1016/0020-0190(75)90056-3zbMath0307.68028MaRDI QIDQ1218265
Publication date: 1975
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(75)90056-3
68W99: Algorithms in computer science
Related Items
An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs, An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem, An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem, The stochastic bottleneck linear programming problem, The hybrid spanning tree problem, Chance constrained bottleneck spanning tree problem