Graph edit distance as a quadratic assignment problem
Authors:
- Sébastien BougleuxSBSébastien Bougleux
- Luc BrunLBLuc Brun
- Vincenzo CarlettiVCVincenzo Carletti
- Pasquale FoggiaPFPasquale Foggia
- Benoit GaüzèreBGBenoit Gaüzère
- Mario VentoMVMario Vento
- 1 February 2017
- journal article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 87, 38-46
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Structural Pattern Recognition with Graph Edit Distance2015
- A Hausdorff Heuristic for Efficient Computation of Graph Edit Distance2014
- GNCCP—Graduated NonConvexityand Concavity ProcedureIEEE Transactions on Pattern Analysis and Machine Intelligence, 2013
- Approximate graph edit distance computation by means of bipartite graph matchingImage and Vision Computing, 2009
- A survey for the quadratic assignment problemEuropean Journal of Operational Research, 2007
- A binary linear programming formulation of the graph edit distanceIEEE Transactions on Pattern Analysis and Machine Intelligence, 2006
- Error correcting graph matching: on the influence of the underlying cost functionIEEE Transactions on Pattern Analysis and Machine Intelligence, 1999
- Inexact graph matching for structural pattern recognitionPattern Recognition Letters, 1983
- The Quadratic Assignment ProblemManagement Science, 1963
- Assignment Problems and the Location of Economic ActivitiesEconometrica, 1957