Login / Signup
Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph
Aditya Bhaskara
Moses Charikar
Eden Chlamtac
Uriel Feige
Aravindan Vijayaraghavan
Published in:
CoRR (2010)
Keyphrases
</>
graph mining
wide range
closed form
high precision
search space
error bounds
automatic detection
probability density function
error tolerance