Exact Graph Edit Distance Computation Using a Binary Linear Program
Authors:
- 5 November 2016
- book chapter
- Published by Springer Nature
- p. 485-495
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Datasets for the Evaluation of Substitution-Tolerant Subgraph Isomorphism2014
- Classy: fast clustering streams of call-graphsData Mining and Knowledge Discovery, 2014
- An integer linear program for substitution-tolerant subgraph isomorphism and its use for symbol spotting in technical drawingsPattern Recognition, 2012
- Two new graphs kernels in chemoinformaticsPattern Recognition Letters, 2012
- A graph matching method and a graph matching distance based on subgraph assignmentsPattern Recognition Letters, 2010
- Comparing starsProceedings of the VLDB Endowment, 2009
- Approximate graph edit distance computation by means of bipartite graph matchingImage and Vision Computing, 2009
- IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning2008
- Fast Suboptimal Algorithms for the Computation of Graph Edit Distance2006
- Bayesian graph edit distanceIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000