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: | Mossel, Elchanan, Xu, Jiaming |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | English |
Published: |
2021
|
Online Access: | https://hdl.handle.net/1721.1/137916 |
Similar Items
-
Seeded graph matching via large neighborhood statistics
by: Mossel, E, et al.
Published: (2021) -
Shotgun assembly of Erdős-Rényi random graphs
by: Gaudio, Julia, et al.
Published: (2022) -
Broadcasting on Random Directed Acyclic Graphs
by: Makur, Anuran, et al.
Published: (2021) -
Regular Graphs with Many Triangles are Structured
by: Van der Hoorn, Pim, et al.
Published: (2022) -
Seeding with Costly Network Information
by: Eckles, Dean, et al.
Published: (2022)