Improved quadratic time approximation of graph edit distance by combining Hausdorff matching and greedy assignment
Authors:
- Andreas FischerAFAndreas Fischer
- Kaspar RiesenKRKaspar Riesen
- Horst BunkeHBHorst Bunke
- 1 February 2017
- journal article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 87, 55-62
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Approximation of graph edit distance based on Hausdorff matchingPattern Recognition, 2015
- Treelet kernel incorporating cyclic, stereo and inter pattern information in chemoinformaticsPattern Recognition, 2015
- A quantum Jensen–Shannon graph kernel for unattributed graphsPattern Recognition, 2015
- GRAPH MATCHING AND LEARNING IN PATTERN RECOGNITION IN THE LAST 10 YEARSInternational Journal of Pattern Recognition and Artificial Intelligence, 2014
- Two new graphs kernels in chemoinformaticsPattern Recognition Letters, 2012
- THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITIONInternational Journal of Pattern Recognition and Artificial Intelligence, 2004
- INEXACT GRAPH MATCHING USING EIGEN-SUBSPACE PROJECTION CLUSTERINGInternational Journal of Pattern Recognition and Artificial Intelligence, 2004
- A Tutorial on Support Vector Machines for Pattern RecognitionData Mining and Knowledge Discovery, 1998
- A survey of heuristics for the weighted matching problemNetworks, 1983
- Inexact graph matching for structural pattern recognitionPattern Recognition Letters, 1983