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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2021-11-09T15:19:02Z.
|
| Subjects: | |
| Online Access: | Get fulltext |