arXiv Machine Learning By Marc Lelarge

Chaining 2-FWL GNNs for Combinatorial Graph Alignment

Read the original on arXiv Machine Learning →

arXiv:2510. 03086v2 Announce Type: replace Abstract: For the combinatorial graph alignment problem (GAP) -- finding the node correspondence that maximizes the number of common edges (nce) between two unlabeled graphs -- properly initialized FAQ remains a strong classical baseline, while existing GNN approaches struggle in the purely structural setting.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.