Seeded Graph Matching via Large Neighborhood Statistics
SODA '19: Symposium on Discrete Algorithms San Diego California January, 2019, pp. 1005-1014, 2019.
We study a well known noisy model of the graph isomorphism problem. In this model, the goal is to perfectly recover the vertex correspondence between two edge-correlated graphs, with an initial seed set of correctly matched vertex pairs revealed as side information. Specifically, the model first generates a parent graph G0 from Erdős-Rény...More
Full Text (Upload PDF)
PPT (Upload PPT)