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 (Author), Xu, Jiaming (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
2021-11-09T15:19:02Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Linear sketching over F<inf>2</inf>
by: Kannan, Sampath, et al.
Published: (2021) -
Index-based Graph Querying and Matching in Large Graphs
by: Zhang, Shijie
Published: (2010) -
Efficiently Finding Neighborhood Patterns in a Large Labeled Graph
by: Chu, Sheng-Chih, et al.
Published: (2015) -
Diversied Subgraph Matching in a Large Graph
Published: (2016) -
Path-Neighborhood Graphs
by: Laskar R.C., et al.
Published: (2013-09-01)