Efficient Distributed Algorithms for Minimum Spanning Tree in Dense Graphs

In recent years, the Massively Parallel Computation (MPC) model capturing the MapReduce framework has become the de facto standard model for large-scale data analysis, given the ubiquity of efficient and affordable cloud implementations. In this model, an input of size m is initially distributed amo...

Full description

Bibliographic Details

Published in:	IEEE ... International Conference on Data Mining workshops pp. 777 - 786
Main Authors:	Bateni, MohammadHossein, Monemzadeh, Morteza, Voorintholt, Kees
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.11.2022
Subjects:	affinity clustering Analytical models Clustering algorithms Computational efficiency Computational modeling Conferences Data analysis Data models distributed setting minimum spanning tree number of rounds work and space efficient algorithm
ISSN:	2375-9259
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!