AI RESEARCH
Neural Graduated Assignment for Maximum Common Edge Subgraphs
arXiv CS.LG
•
ArXi:2505.12325v3 Announce Type: replace The Maximum Common Edge Subgraph (MCES) problem is a crucial challenge with significant implications in domains such as biology and chemistry. Traditional approaches, which include transformations into max-clique and search-based algorithms, suffer from scalability issues when dealing with larger instances. This paper