433 citations · 968 across the 48 of their papers we have counts for
Showing 2019 · cs.DBShow all
3 papers · 2 filters
cs.DB2019
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…
cs.DB2019★ 3 cited
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★ 9 cited
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…