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...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE ... International Conference on Data Mining workshops s. 777 - 786
Hlavní autori:	Bateni, MohammadHossein, Monemzadeh, Morteza, Voorintholt, Kees
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.11.2022
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!