48 citations · 111 across the 9 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DB2019
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…
cs.DB2019
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…
cs.DB2019★ 20 cited
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…