2 papers
cs.LG2024
Computing Approximate Graph Edit Distance via Optimal Transport
Qihao Cheng, Da Yan, Tianhao Wu +2
Given a graph pair , graph edit distance (GED) is defined as the minimum number of edit operations converting to . GED is a fundamental operation widely used…
cs.DS2024
Efficient Enumeration of Large Maximal k-Plexes
Qihao Cheng, Da Yan, Tianhao Wu +4
Finding cohesive subgraphs in a large graph has many important applications, such as community detection and biological network analysis. Clique is often a too strict cohesive stru…