4 papers · 1 filter
Efficient Graph Indexing for Interval-Aware Vector Search
Siyuan Liang, Ziqi Yin, Qi Zhang +5
Interval-aware Approximate Nearest Neighbor (ANN) search arises in applications where each object is associated with a numeric value or interval, and queries must satisfy both vect…
Optimal -Dense Subgraph Search in Bipartite Graphs
Yalong Zhang, Rong-Hua Li, Qi Zhang +1
Dense subgraph search in bipartite graphs is a fundamental problem in graph analysis, with wide-ranging applications in fraud detection, recommendation systems, and social network…
Efficient Maximum Fair Clique Search over Large Networks
Qi Zhang, Rong-Hua Li, Zifan Zheng +3
Mining cohesive subgraphs in attributed graphs is an essential problem in the domain of graph data analysis. The integration of fairness considerations significantly fuels interest…
Efficient Top-k Ego-Betweenness Search
Qi Zhang, Rong-Hua Li, Minjia Pan +3
Betweenness centrality, measured by the number of times a vertex occurs on all shortest paths of a graph, has been recognized as a key indicator for the importance of a vertex in t…