A Survey and Experimental Analysis of Distributed Subgraph Matching

Longbin Lai, Zhu Qing, Zhengyi Yang +10

Effective Multi-Query Expansions: Collaborative Deep Networks for Robust Landmark Retrieval

Yang Wang, Xuemin Lin, Lin Wu +1

Critical Edge Identification: A K-Truss Based Model

Wenjie Zhu, Mengqi Zhang, Chen Chen +3

Efficient Butterfly Counting for Large Bipartite Networks

Kai Wang, Xuemin Lin, Lu Qin +2

K-Core Maximization through Edge Additions

Zhongxin Zhou, Fan Zhang, Xuemin Lin +2

Enumerating k-Vertex Connected Components in Large Graphs

Dong Wen, Lu Qin, Xuemin Lin +2

Efficient Algorithms for Densest Subgraph Discovery

Yixiang Fang, Kaiqiang Yu, Reynold Cheng +2

The paper introduces a new approach for finding densest subgraphs by leveraging k‑core structures, providing exact and approximate algorithms that work for various density definiti…

Dynamical SimRank Search on Time-Varying Networks

Weiren Yu, Xuemin Lin, Wenjie Zhang +1

Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information

Haida Zhang, Zengfeng Huang, Xuemin Lin +3

I/O Efficient Core Graph Decomposition at Web Scale

Dong Wen, Lu Qin, Ying Zhang +2

Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation

Lijun Chang, Xing Feng, Xuemin Lin +2

Top-k Spatial-keyword Publish/Subscribe Over Sliding Window

Xiang Wang, Ying Zhang, Wenjie Zhang +2

When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks

Fan Zhang, Ying Zhang, Lu Qin +2

Iterative Views Agreement: An Iterative Low-Rank based Structured Optimization Method to Multi-View Spectral Clustering

Yang Wang, Wenjie Zhang, Lin Wu +3

Approximate Nearest Neighbor Search on High Dimensional Data --- Experiments, Analyses, and Improvement (v1.0)

Wen Li, Ying Zhang, Yifang Sun +3

An Optimal and Progressive Approach to Online Search of Top-k Influential Communities

Fei Bi, Lijun Chang, Xuemin Lin +1