19 citations · 19 across the 1 of their papers we have counts for
3 papers
Vertex Nomination Via Seeded Graph Matching
Heather G. Patsolic, Youngser Park, Vince Lyzinski +1
Consider two networks on overlapping, non-identical vertex sets. Given vertices of interest in the first network, we seek to identify the corresponding vertices, if any exist, in t…
Seeded Graph Matching Via Joint Optimization of Fidelity and Commensurability
Heather Patsolic, Sancar Adali, Joshua T. Vogelstein +4
We present a novel approximate graph matching algorithm that incorporates seeded data into the graph matching paradigm. Our Joint Optimization of Fidelity and Commensurability (JOF…
Seeded Graph Matching
Donniell E. Fishkind, Sancar Adali, Heather G. Patsolic +4
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 matchi…