4 citations · 13 across the 10 of their papers we have counts for
6 papers · 1 filter
Efficient Approximate Nearest Neighbor Search under Multi-Attribute Range Filter
Yuanhang Yu, Dawei Cheng, Ying Zhang +3
Nearest neighbor search on high-dimensional vectors is fundamental in modern AI and database systems. In many real-world applications, queries involve constraints on multiple numer…
Efficient and Effective Community Search on Large-scale Bipartite Graphs
Kai Wang, Wenjie Zhang, Xuemin Lin +3
Bipartite graphs are widely used to model relationships between two types of entities. Community search retrieves densely connected subgraphs containing a query vertex, which has b…
AOT: Pushing the Efficiency Boundary of Main-memory Triangle Listing
Michael Yu, Lu Qin, Ying Zhang +2
Triangle listing is an important topic significant in many practical applications. Efficient algorithms exist for the task of triangle listing. Recent algorithms leverage an orient…
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs
Kai Wang, Xuemin Lin, Lu Qin +2
Cohesive subgraph mining in bipartite graphs becomes a popular research topic recently. An important structure k-bitruss is the maximal cohesive subgraph where each edge is contain…
A Survey and Experimental Analysis of Distributed Subgraph Matching
Longbin Lai, Zhu Qing, Zhengyi Yang +10
Recently there emerge many distributed algorithms that aim at solving subgraph matching at scale. Existing algorithm-level comparisons failed to provide a systematic view to the pr…
Enumerating k-Vertex Connected Components in Large Graphs
Dong Wen, Lu Qin, Xuemin Lin +2
Cohesive subgraph detection is an important graph problem that is widely applied in many application domains, such as social community detection, network visualization, and network…