Fast and Memory-Efficient Approximate Minimum Spanning Tree Generation for Large Datasets
Crossref DOI link: https://doi.org/10.1007/s13369-024-08974-y
Published Online: 2024-06-21
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Almansoori, Mahmood K. M. http://orcid.org/0000-0001-5274-5555
Meszaros, Andras
Telek, Miklos
Funding for this research was provided by:
Budapest University of Technology and Economics
Text and Data Mining valid from 2024-06-21
Version of Record valid from 2024-06-21
Article History
Received: 17 September 2023
Accepted: 11 March 2024
First Online: 21 June 2024