Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1206.1113
Cited By
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
Re-assign community
ArXiv
PDF
HTML
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
A. Bernstein
K. Kirchberg
11
49
0
08 Nov 2018
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
Bernhard Haeupler
Jason Li
Goran Zuzic
11
32
0
18 Jan 2018
Almost-Tight Distributed Minimum Cut Algorithms
Danupon Nanongkai
Hsin-Hao Su
47
54
0
04 Aug 2014
Distributed Random Walks
Atish Das Sarma
Danupon Nanongkai
Gopal Pandurangan
P. Tetali
111
65
0
19 Feb 2013
1