Login / Signup
(p,q)-biclique counting and enumeration for large sparse bipartite graphs.
Jianye Yang
Yun Peng
Dian Ouyang
Wenjie Zhang
Xuemin Lin
Xiang Zhao
Published in:
VLDB J. (2023)
Keyphrases
</>
bipartite graph
maximum matching
minimum weight
bipartite graph matching
link prediction
maximum cardinality
search space
graph clustering
sparse representation
maximum weight
bipartite networks
mutual reinforcement
edge weights
hits algorithm