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. 1206.1113
  4. Cited By
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in
  the SINR Model

A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model

6 June 2012
Maleq Khan
V. S. Anil Kumar
Gopal Pandurangan
Guanhong Pei
ArXivPDFHTML

Papers citing "A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model"

5 / 5 papers shown
Title
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time
A. Bernstein
K. Kirchberg
11
49
0
08 Nov 2018
Broadcast and minimum spanning tree with $o(m)$ messages in the
  asynchronous CONGEST model
Broadcast and minimum spanning tree with o(m)o(m)o(m) messages in the asynchronous CONGEST model
A. Mashreghi
Valerie King
23
29
0
12 Jun 2018
Minor Excluded Network Families Admit Fast Distributed Algorithms
Minor Excluded Network Families Admit Fast Distributed Algorithms
Bernhard Haeupler
Jason Li
Goran Zuzic
11
32
0
18 Jan 2018
Almost-Tight Distributed Minimum Cut Algorithms
Almost-Tight Distributed Minimum Cut Algorithms
Danupon Nanongkai
Hsin-Hao Su
47
54
0
04 Aug 2014
Distributed Random Walks
Distributed Random Walks
Atish Das Sarma
Danupon Nanongkai
Gopal Pandurangan
P. Tetali
111
65
0
19 Feb 2013
1