Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Super-Fast MST Algorithms in the Congested Clique Using o(m) Messages - MaRDI portal

Super-Fast MST Algorithms in the Congested Clique Using o(m) Messages

From MaRDI portal

Publication:4636597

Jump to:navigation, search

DOI10.4230/LIPIcs.FSTTCS.2016.47zbMath1391.68119arXiv1610.03897OpenAlexW2535798727MaRDI QIDQ4636597

Vivek B. Sardeshmukh, Sriram V. Pemmaraju

Publication date: 19 April 2018

Full work available at URL: https://arxiv.org/abs/1610.03897

zbMATH Keywords

sampling minimum spanning tree message complexity congested clique linear graph sketches

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (1)

Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE

This page was built for publication: Super-Fast MST Algorithms in the Congested Clique Using o(m) Messages

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4636597&oldid=18819410"