2 citations · 2 across the 8 of their papers we have counts for
4 papers · 1 filter
Temporal -Core Query, Revisited
Yinyu Liu, Kaiqiang Yu, Shengxin Liu +2
Querying cohesive subgraphs in temporal graphs is essential for understanding the dynamic structure of real-world networks, such as evolving communities in social platforms, shifti…
Maximum Degree-Based Quasi-Clique Search via an Iterative Framework
Hongbo Xia, Kaiqiang Yu, Shengxin Liu +2
Cohesive subgraph mining is a fundamental problem in graph theory with numerous real-world applications, such as social network analysis and protein-protein interaction modeling. A…
Generalization in Federated Learning: A Conditional Mutual Information Framework
Ziqiao Wang, Cheng Long, Yongyi Mao
Federated learning (FL) is a widely adopted privacy-preserving distributed learning framework, yet its generalization performance remains less explored compared to centralized lear…
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
Kaiqiang Yu, Kaixin Wang, Cheng Long +2
Given two input graphs, finding the largest subgraph that occurs in both, i.e., finding the maximum common subgraph, is a fundamental operator for evaluating the similarity between…