Fetching the paper…
Reading the bibliography…
The graph matching problem seeks to find an alignment between the nodes of two graphs that minimizes the number of adjacency disagreements.
GraSPy: Graph Statistics in Python
Jaewon Chung, Benjamin D Pedigo, Eric W Bridgeford, Bijan K Varjavand, and Joshua T Vogelstein · 1904
Earlier work this paper cites.
The hungarian method for the assignment problem
H. W. Kuhn · 1955
Earlier work this paper cites.
Concerning nonnegative matrices and doubly stochastic matrices
Paul Knopp and Richard Sinkhorn · 1967
Earlier work this paper cites.
Error-correcting isomorphisms of attributed relational graphs for pattern analysis
Wen-Hsiang Tsai and King-Sun Fu · 1979
Earlier work this paper cites.
Stochastic blockmodels: First steps
Paul W. Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt · 1983
Earlier work this paper cites.
Combinatorial optimization:algorithms and complexity
L. Rabiner · 1984
Earlier work this paper cites.
A shortest augmenting path algorithm for dense and sparse linear assignment problems
Volgenant T. Jonker R · 1987
Earlier work this paper cites.
An eigendecomposition approach to weighted graph matching problems
S. Umeyama · 1988
Earlier work this paper cites.
Qaplib – a quadratic assignment problem library
Rainer E. Burkard and Franz Rendl · 1997
Earlier work this paper cites.
The Quadratic Assignment Problem , pages 1713–1809
Rainer E. Burkard, Eranda Çela, Panos M. Pardalos, and Leonidas S. Pitsoulis · 1998
Earlier work this paper cites.
Efficient matching and indexing of graph models in content-based retrieval
S. Berretti, A. Del Bimbo, and E. Vicario · 2001
Cited alongside, same era.
Thirty years of graph matching in pattern recognition
D. CONTE, P. FOGGIA, C. SANSONE, and M. VENTO · 2004
Cited alongside, same era.
Matplotlib: A 2d graphics environment
John D Hunter · 2007
Cited alongside, same era.
Pairwise global alignment of protein interaction networks by matching neighborhood topology
Rohit Singh, Jinbo Xu, and Bonnie Berger · 2007
Cited alongside, same era.
A path following algorithm for the graph matching problem
Mikhail Zaslavskiy, Francis Bach, and Jean-Philippe Vert · 2008
Cited alongside, same era.
Data structures for statistical computing in python
Wes McKinney et al · 2010
Seeded graph matching
Donniell E. Fishkind, Sancar Adali, Heather G. Patsolic, Lingyao Meng, Digvijay Singh, Vince Lyzinski, and Carey E. Priebe · 2018
Later among the works it cites.
Vertex nomination via seeded graph matching
Heather G. Patsolic, Youngser Park, Vince Lyzinski, and Carey E. Priebe · 2019
Later among the works it cites.
Computational Optimal Transport: With Applications to Data Science
Gabriel Peyré and Marco Cuturi · 2019
Later among the works it cites.
Connectal coding: Discovering the structures linking cognitive phenotypes to individual histories
Joshua T. Vogelstein, Eric W. Bridgeford, Benjamin D. Pedigo, Jaewon Chung, Keith Levin, Brett Mensh, and Carey E. Priebe · 2019
Later among the works it cites.
Array programming with NumPy
Charles R. Harris, K. Jarrod Millman, Stéfan J. van der Walt, Ralf Gommers, Pauli Virtanen, David Cournapeau, Eric Wieser, Julian Taylor, Sebastian Berg, Nathaniel J. Smith, Robert Kern, Matti Picus, Stephan Hoyer, Marten H. van Kerkwijk, Matthew Brett, Allan Haldane, Jaime Fernández del Río, Mark Wiebe, Pearu Peterson, Pierre Gérard-Marchant, Kevin Sheppard, Tyler Reddy, Warren Weckesser, Hameer Abbasi, Christoph Gohlke, and Travis E. Oliphant · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Sinkhorn distances: Lightspeed computation of optimal transport
Marco Cuturi · 2013
Cited alongside, same era.
Graph matching and learning in pattern recognition in the last 10 years
Pasquale Foggia, Gennaro Percannella, and Mario Vento · 2014
Cited alongside, same era.
Spectral clustering for divide-and-conquer graph matching
Vince Lyzinski, Daniel L. Sussman, Donniell E. Fishkind, Henry Pao, Li Chen, Joshua T. Vogelstein, Youngser Park, and Carey E. Priebe · 2015
Cited alongside, same era.
Fast approximate quadratic programming for graph matching
Joshua T. Vogelstein, John M. Conroy, Vince Lyzinski, Louis J. Podrazik, Steven G. Kratzer, Eric T. Harley, Donniell E. Fishkind, R. Jacob Vogelstein, and Carey E. Priebe · 2015
Cited alongside, same era.
Scipy 1.0: fundamental algorithms for scientific computing in python, 2020
P. Virtanen, R. Gommers, Oliphant, and T.E. et al · 2020
Later among the works it cites.
Statistical connectomics
Jaewon Chung, Eric Bridgeford, Jesús Arroyo, Benjamin D. Pedigo, Ali Saad-Eldin, Vivek Gopalakrishnan, Liang Xiang, Carey E. Priebe, and Joshua T. Vogelstein · 2021
Closest in time.
Dynamic silos: Modularity in intra-organizational communication networks during the covid-19 pandemic, 2021
Jonathan Larson, Tiona Zuzul, Emily Cox Pahnke, Neha Parikh Shah, Patrick Bourke, Nicholas Caurvina, Fereshteh Amini, Youngser Park, Joshua Vogelstein, Jeffrey Weston, Christopher White, and Carey E. Priebe · 2021
Closest in time.
Pot: Python optimal transport
Flamary R., Courty N., Gramfort A., and et al · 2021
Closest in time.
seaborn: statistical data visualization
Michael L. Waskom · 2021
Closest in time.