Showing cs.DBShow all
2 papers · 1 filter
cs.DB2022
Reinforcement Learning Enhanced Weighted Sampling for Accurate Subgraph Counting on Fully Dynamic Graph Streams
Kaixin Wang, Cheng Long, Da Yan +2
As the popularity of graph data increases, there is a growing need to count the occurrences of subgraph patterns of interest, for a variety of applications. Many graphs are massive…
cs.DB2021
Efficient Algorithms for Maximal k-Biplex Enumeration
Kaiqiang Yu, Cheng Long, Shengxin Liu +1
Mining maximal subgraphs with cohesive structures from a bipartite graph has been widely studied. One important cohesive structure on bipartite graphs is k-biplex, where each verte…