ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1610.03897
  4. Cited By
Super-fast MST Algorithms in the Congested Clique using $o(m)$ Messages
v1v2 (latest)

Super-fast MST Algorithms in the Congested Clique using o(m)o(m)o(m) Messages

12 October 2016
Sriram V. Pemmaraju
Vivek Sardeshmukh
    LRM
ArXiv (abs)PDFHTML

Papers citing "Super-fast MST Algorithms in the Congested Clique using $o(m)$ Messages"

2 / 2 papers shown
Title
Faster Algorithms for Edge Connectivity via Random $2$-Out Contractions
Faster Algorithms for Edge Connectivity via Random 222-Out Contractions
M. Ghaffari
Krzysztof Nowicki
M. Thorup
157
50
0
02 Sep 2019
MST in O(1) Rounds of the Congested Clique
MST in O(1) Rounds of the Congested Clique
T. Jurdzinski
Krzysztof Nowicki
LRM
49
92
0
26 Jul 2017
1