Login / Signup

LINC: A Motif Counting Algorithm for Uncertain Graphs.

Chenhao MaReynold ChengLaks V. S. LakshmananTobias GrubenmannYixiang FangXiaodong Li
Published in: Proc. VLDB Endow. (2019)
Keyphrases
  • learning algorithm
  • optimal solution
  • k means
  • computational complexity
  • graph structure
  • undirected graph