Fetching the paper…
Reading the bibliography…
An isomorphism between two graphs is a bijection between their vertices that preserves the edges.
Graphs of degree three with a given abstract group
R. Frucht · 1949
Earlier work this paper cites.
The Hungarian method for the assignment problem
H. W. Kuhn · 1955
Earlier work this paper cites.
A congruence theorem for trees
P. J. Kelly et al · 1957
Earlier work this paper cites.
Asymmetric graphs
R. Erdős and A. Rényi · 1963
Earlier work this paper cites.
Linear time algorithm for isomorphism of planar graphs (preliminary report)
J. E. Hopcroft and J. Wong · 1974
Earlier work this paper cites.
Computers and intractability: A guide to np-completeness, 1979
M. R. Garey and D. S. Johnson · 1979
Earlier work this paper cites.
A linear time algorithm for deciding interval graph isomorphism
G. S. Lueker and K. S. Booth · 1979
Earlier work this paper cites.
Isomorphism of graphs of bounded valence can be tested in polynomial time
E. M. Luks · 1980
Earlier work this paper cites.
On testing isomorphism of permutation graphs
C. J. Colbourn · 1981
Earlier work this paper cites.
Isomorphism of graphs with bounded eigenvalue multiplicity
L. Babai, D. Y. Grigorye, and D. M. Mount · 1982
Earlier work this paper cites.
An eigendecomposition approach to weighted graph matching problems
S. Umeyama · 1988
Cited alongside, same era.
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
H. L. Bodlaender · 1990
Cited alongside, same era.
A note on compact graphs
G. Tinhofer · 1991
Cited alongside, same era.
A large database of graphs and its use for benchmarking graph isomorphism algorithms
M. De Santo, P. Foggia, C. Sansone, and M. Vento · 2003
Cited alongside, same era.
Convex Optimization
S. Boyd and L. Vandenberghe · 2004
Cited alongside, same era.
Graph matching–filtering databases of graphs using machine learning techniques
C. M. Irniger · 2005
Cited alongside, same era.
Distributed optimization and statistical learning via the alternating direction method of multipliers
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein · 2011
Later among the works it cites.
Conflict propagation and component recursion for canonical labeling
T. Junttila and P. Kaski · 2011
Later among the works it cites.
Conauto-2.0: Fast isomorphism testing and automorphism group computation
J. L. López-Presa, A. F. Anta, and L. N. Chiroque · 2011
Later among the works it cites.
Fractional Graph Theory: A Rational Approach to the Theory of Graphs
E. R. Scheinerman and D. H. Ullman · 2011
Later among the works it cites.
ECOS: An SOCP solver for embedded systems
A. Domahidi, E. Chu, and S. Boyd · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Engineering an efficient canonical labeling tool for large and sparse graphs
T. Junttila and P. Kaski · 2007
Cited alongside, same era.
Applied graph theory in computer vision and pattern recognition
A. Kandel, H. Bunke, and M. Last · 2007
Cited alongside, same era.
Engineering an efficient canonical labeling tool for large and sparse graphs
T. A. Junttila and P. Kaski · 2009
Cited alongside, same era.
Fast algorithm for graph isomorphism testing
J. L. López-Presa and A. F. Anta · 2009
Cited alongside, same era.
Y. Aflalo, A. Bronstein, and R. Kimmel · 2014
Later among the works it cites.
On spectral properties for graph matching and graph isomorphism problems
M. Fiori and G. Sapiro · 2014
Later among the works it cites.
Graph matching: Relax at your own risk
V. Lyzinski, D. Fishkind, M. Fiori, J. T. Vogelstein, C. E. Priebe, and G. Sapiro · 2014
Later among the works it cites.
On convex relaxation of graph isomorphism
Y. Aflalo, A. Bronstein, and R. Kimmel · 2015
Later among the works it cites.
Graph isomorphism in quasipolynomial time
L. Babai · 2015
Later among the works it cites.