1 citations · 1 across the 1 of their papers we have counts for
5 papers
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…
Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach
Yichun Yang, Rong-Hua Li, Meihao Liao +2
Graph propagation (GP) computation plays a crucial role in graph data analysis, supporting various applications such as graph node similarity queries, graph node ranking, graph clu…
PSNE: Efficient Spectral Sparsification Algorithms for Scaling Network Embedding
Longlong Lin, Yunfeng Yu, Zihao Wang +4
Network embedding has numerous practical applications and has received extensive attention in graph learning, which aims at mapping vertices into a low-dimensional and continuous d…
PSMC: Provable and Scalable Algorithms for Motif Conductance Based Graph Clustering
Longlong Lin, Tao Jia, Zeli Wang +2
Higher-order graph clustering aims to partition the graph using frequently occurring subgraphs. Motif conductance is one of the most promising higher-order graph clustering models…
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…