1 citations · 1 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
Xiaowei Ye, Rong-Hua Li, Longlong Lin +2
Counting the number of -bicliques (complete bipartite subgraphs) in a bipartite graph is a fundamental problem which plays a crucial role in numerous bipartite graph analys…
cs.DS2023★ 1 cited
Query-Centered Temporal Community Search via Time-Constrained Personalized PageRank
Longlong Lin, Pingpeng Yuan, Rong-Hua Li +4
Existing temporal community search suffers from two defects: (i) they ignore the temporal proximity between the query vertex and other vertices but simply require the result to…