5 papers
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…
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…
Counting Cohesive Subgraphs with Hereditary Properties
Rong-Hua Li, Xiaowei Ye, Fusheng Jin +3
Counting small cohesive subgraphs in a graph is a fundamental operation with numerous applications in graph analysis. Previous studies on cohesive subgraph counting are mainly base…
Scalable -clique Densest Subgraph Search
Xiaowei Ye, Miao Qiao, Rong-Hua Li +2
In this paper, we present a collection of novel and scalable algorithms designed to tackle the challenges inherent in the -clique densest subgraph problem (\kcdsp) within networ…
Strong Spatial Mixing for General 2-Spin Systems: A Unified Approach from Zero-Freeness
Shuai Shao, Xiaowei Ye
We study the algorithmic implications of zero-free regions for the partition functions of 2-spin systems. While Barvinok's algorithm yields FPTASes in such regions, the applicabili…