Login / Signup
The densest subgraph problem in sparse random graphs.
Venkat Anantharam
Justin Salez
Published in:
CoRR (2013)
Keyphrases
</>
random graphs
graph mining
graph theoretic
similarity graph
dense subgraphs
phase transition
learning curves
graph databases
pattern mining
small world
undirected graph
itemsets
np hard
connected components
network analysis
search space
search algorithm