Login / Signup
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons.
Devdatt P. Dubhashi
Alessandro Mei
Alessandro Panconesi
Jaikumar Radhakrishnan
Aravind Srinivasan
Published in:
SODA (2003)
Keyphrases
</>
computational complexity
orders of magnitude
theoretical analysis
computationally efficient
linear models
np hard
distributed systems
data structure
benchmark datasets
learning algorithm
computational cost
cooperative
computational efficiency
times faster
distributed environment
space complexity
data sets