Seeded Graph Matching via Large Neighborhood Statistics

Copyright © 2019 by SIAM 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. Specific...

ver descrição completa

Detalhes bibliográficos
Principais autores: Mossel, Elchanan, Xu, Jiaming
Outros Autores: Massachusetts Institute of Technology. Department of Mathematics
Formato: Artigo
Idioma:English
Publicado em: 2021
Acesso em linha:https://hdl.handle.net/1721.1/137916

Registros relacionados