433 citations · 968 across the 48 of their papers we have counts for
6 papers · 1 filter
Collective Entity Alignment via Adaptive Features
Weixin Zeng, Xiang Zhao, Jiuyang Tang +1
Entity alignment (EA) identifies entities that refer to the same real-world object but locate in different knowledge graphs (KGs), and has been harnessed for KG construction and in…
Critical Edge Identification: A K-Truss Based Model
Wenjie Zhu, Mengqi Zhang, Chen Chen +3
In a social network, the strength of relationships between users can significantly affect the stability of the network. In this paper, we use the k-truss model to measure the stabi…
K-Core Maximization through Edge Additions
Zhongxin Zhou, Fan Zhang, Xuemin Lin +2
A popular model to measure the stability of a network is k-core - the maximal induced subgraph in which every vertex has at least k neighbors. Many studies maximize the number of v…
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…
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…