Login / Signup
Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling.
Maryam Aliakbarpour
Amartya Shankha Biswas
Themis Gouleakis
John Peebles
Ronitt Rubinfeld
Anak Yodpinyanee
Published in:
Algorithmica (2018)
Keyphrases
</>
data structure
learning algorithm
orders of magnitude
sampling methods
computational complexity
computational cost
edge detection
theoretical analysis
sampling strategy
binary search trees
neural network
computationally efficient
combinatorial optimization
metropolis hastings