Seeded graph matching via large neighborhood statistics
© 2020 Wiley Periodicals, LLC. We study a noisy graph isomorphism problem, where 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. We show that it is possible to achi...
| Main Authors: | , |
|---|---|
| 其他作者: | |
| 格式: | 文件 |
| 语言: | English |
| 出版: |
Wiley
2021
|
| 在线阅读: | https://hdl.handle.net/1721.1/135321 |