Graph matching: relax or not?

The Hungarian method for the assignment problem

Harold W Kuhn · 1955

Earlier work this paper cites.

The Design and Analysis of Computer Algorithms

Alfred V Aho and John E Hopcroft · 1974

Earlier work this paper cites.

Linear time algorithm for isomorphism of planar graphs

John E Hopcroft and Jin-Kue Wong · 1974

Earlier work this paper cites.

Moderately exponential bound for graph isomorphism

László Babai · 1981

Earlier work this paper cites.

Isomorphism of graphs of bounded valence can be tested in polynomial time

Eugene M Luks · 1982

Earlier work this paper cites.

Fingerprint identification using graph matching

DK Isenor and Safwat G Zaky · 1986

Earlier work this paper cites.

A linear programming approach for the weighted graph matching problem

HA Almohamad and Salih O Duffuaa · 1993

Earlier work this paper cites.

Distortion invariant object recognition in the dynamic link architecture

Martin Lades, Jan C Vorbruggen, Joachim Buhmann, Jörg Lange, Christoph von der Malsburg, Rolf P Wurtz, and Wolfgang Konen · 1993

Earlier work this paper cites.

A shape analysis model with applications to a character recognition system

Jairo Rocha and Theodosios Pavlidis · 1994

Earlier work this paper cites.

Structural matching in computer vision using probabilistic relaxation

William J. Christmas, Josef Kittler, and Maria Petrou · 1995

Earlier work this paper cites.

The graph isomorphism problem

Scott Fortin · 1996

Cited alongside, same era.

Face recognition by elastic bunch graph matching

Original

Laurenz Wiskott, J-M Fellous, N Kuiger, and Christoph Von Der Malsburg · 1997

Cited alongside, same era.

A unifying framework for relational structure matching

M. Pelillo · 1998

Cited alongside, same era.

Nonlinear programming

Dimitri P Bertsekas · 1999

Cited alongside, same era.

Matching hierarchical structures using association graphs

Marcello Pelillo, Kaleem Siddiqi, and Steven W Zucker · 1999

Cited alongside, same era.

Efficient matching and indexing of graph models in content-based retrieval

Stefano Berretti, Alberto Del Bimbo, and Enrico Vicario · 2001

Cited alongside, same era.

A spectral technique for correspondence problems using pairwise constraints

Marius Leordeanu and Martial Hebert · 2005

Later among the works it cites.

The Human Connectome: a structural description of the human brain

Olaf Sporns, Giulio Tononi, and Rolf Kötter · 2005

Later among the works it cites.

Generalized multidimensional scaling: a framework for isometry-invariant partial surface matching

Alexander M Bronstein, Michael M Bronstein, and Ron Kimmel · 2006

Later among the works it cites.

Mining graph data

Diane J Cook and Lawrence B Holder · 2006

Later among the works it cites.

A survey of graph edit distance

Xinbo Gao, Bing Xiao, Dacheng Tao, and Xuelong Li · 2010

Later among the works it cites.

Graph-based quadratic optimization: A fast evolutionary approach

Samuel Rota Bulò, Marcello Pelillo, and Immanuel M. Bomze · 2011

Later among the works it cites.