An alternative for the implementation of Kruskal's minimal spanning tree algorithm

DOI10.1016/0167-6423(83)90011-4zbMath0523.68053OpenAlexW2057308404MaRDI QIDQ1056544

Jyrki Katajainen, Olli S. Nevalainen

Publication date: 1983

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(83)90011-4

zbMATH Keywords

minimal spanning treebucket sort

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

This page was built for publication: An alternative for the implementation of Kruskal's minimal spanning tree algorithm