97 citations · 167 across the 24 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DB2017
Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation
Lijun Chang, Xing Feng, Xuemin Lin +2
Graph edit distance (GED) is an important similarity measure adopted in a similarity-based analysis between two graphs, and computing GED is a primitive operator in graph database…
cs.DB2017★ 4 cited
Enumerating k-Vertex Connected Components in Large Graphs
Dong Wen, Lu Qin, Xuemin Lin +2
Cohesive subgraph detection is an important graph problem that is widely applied in many application domains, such as social community detection, network visualization, and network…