48 citations · 123 across the 11 of their papers we have counts for
5 papers · 1 filter
An Augmented Index-based Efficient Community Search for Large Directed Graphs
Yankai Chen, Jie Zhang, Yixiang Fang +2
Given a graph G and a query vertex q, the topic of community search (CS), aiming to retrieve a dense subgraph of G containing q, has gained much attention. Most existing works focu…
WISK: A Workload-aware Learned Index for Spatial Keyword Queries
Yufan Sheng, Xin Cao, Yixiang Fang +4
Spatial objects often come with textual information, such as Points of Interest (POIs) with their descriptions, which are referred to as geo-textual data. To retrieve such data, sp…
Efficient Algorithms for Densest Subgraph Discovery
Yixiang Fang, Kaiqiang Yu, Reynold Cheng +2
Densest subgraph discovery (DSD) is a fundamental problem in graph mining. It has been studied for decades, and is widely used in various areas, including network science, biologic…
A Survey of Community Search Over Big Graphs
Yixiang Fang, Xin Huang, Lu Qin +4
With the rapid development of information technologies, various big graphs are prevalent in many real applications (e.g., social media and knowledge bases). An important component…
Exploring Communities in Large Profiled Graphs
Yankai Chen, Yixiang Fang, Reynold Cheng +3
Given a graph and a vertex , the community search (CS) problem aims to efficiently find a subgraph of whose vertices are closely related to . Communities are pre…