Login / Signup
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs.
Chenhao Ma
Yixiang Fang
Reynold Cheng
Laks V. S. Lakshmanan
Wenjie Zhang
Xuemin Lin
Published in:
SIGMOD Conference (2020)
Keyphrases
</>
directed graph
random walk
graph mining
similarity graph
directed acyclic graph
undirected graph
strongly connected
data mining
graph structures
objective function
pairwise
special case
probability distribution
maximum flow