1 citations · 1 across the 21 of their papers we have counts for
4 papers · 1 filter
Revisiting Maximum -Biplex Search Through -Bounded-Degree Deletion
Donghang Cui, Ronghua Li, Qiangqiang Dai +1
Biplex, as a relaxation of the biclique model, has emerged as an important cohesive subgraph model for bipartite graph analysis. The maximum -biplex search problem aims to ident…
MCI: A Maximal Clique Index for Efficient Arbitrary-Filtered Approximate Nearest Neighbor Search
Xiaowei Ye, Rong-Hua Li, Guoren Wang +3
Approximate Nearest Neighbor Search with arbitrary filtering predicates (AFANNS) is essential for modern data applications, yet existing methods often incur substantial storage and…
Density Decomposition on Hypergraphs
Xiaoyu Leng, Hongchao Qin, Rong-Hua Li
Decomposing hypergraphs is a key task in hypergraph analysis with broad applications in community detection, pattern discovery, and task scheduling. Existing approaches such as …
RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search
Zhiqiu Zou, Ziqi Yin, Rong-Hua Li +3
Range-filtered approximate nearest neighbor (RFANN) search is a fundamental operation in modern data systems. Given a set of objects, each with a vector and a numerical attribute,…