Seeded Graph Matching via Large Neighborhood Statistics

SODA '19: Symposium on Discrete Algorithms San Diego California January, 2019, pp. 1005-1014, 2019.

Cited by: 18|Bibtex|Views9|DOI:https://doi.org/10.5555/3310435.3310497
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|dl.acm.org|arxiv.org

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments