Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Seeded Graph Matching (1209.0367v4)

Published 3 Sep 2012 in stat.ML

Abstract: Given two graphs, the graph matching problem is to align the two vertex sets so as to minimize the number of adjacency disagreements between the two graphs. The seeded graph matching problem is the graph matching problem when we are first given a partial alignment that we are tasked with completing. In this paper, we modify the state-of-the-art approximate graph matching algorithm "FAQ" of Vogelstein et al. (2015) to make it a fast approximate seeded graph matching algorithm, adapt its applicability to include graphs with differently sized vertex sets, and extend the algorithm so as to provide, for each individual vertex, a nomination list of likely matches. We demonstrate the effectiveness of our algorithm via simulation and real data experiments; indeed, knowledge of even a few seeds can be extremely effective when our seeded graph matching algorithm is used to recover a naturally existing alignment that is only partially observed.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (7)
  1. Donniell E. Fishkind (13 papers)
  2. Sancar Adali (6 papers)
  3. Heather G. Patsolic (2 papers)
  4. Lingyao Meng (6 papers)
  5. Digvijay Singh (5 papers)
  6. Vince Lyzinski (56 papers)
  7. Carey E. Priebe (155 papers)
Citations (75)

Summary

We haven't generated a summary for this paper yet.