A Local Branching Heuristic for the Graph Edit Distance Problem
- 4 February 2018
- book chapter
- Published by Springer Nature
- p. 194-202
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Graph edit distance as a quadratic assignment problemPattern Recognition Letters, 2017
- Exact Graph Edit Distance Computation Using a Binary Linear Program2016
- Improving bipartite graph matching by assessing the assignment confidencePattern Recognition Letters, 2015
- A Graph Database Repository and Performance Evaluation Metrics for Graph Edit Distance2015
- Bipartite Graph Matching for Computing the Edit Distance of GraphsLecture Notes in Computer Science, 2006
- A binary linear programming formulation of the graph edit distanceIEEE Transactions on Pattern Analysis and Machine Intelligence, 2006
- Fast Suboptimal Algorithms for the Computation of Graph Edit Distance2006
- Local branchingMathematical Programming, 2003
- Maximum common subgraph isomorphism algorithms for the matching of chemical structuresJournal of Computer-Aided Molecular Design, 2002
- On a relation between graph edit distance and maximum common subgraphPattern Recognition Letters, 1997