Improved local search for graph edit distance

Published: 01 Jan 2020, Last Modified: 26 Apr 2024Pattern Recognit. Lett. 2020EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•We present K-REFINE, a new local search algorithm for upper bounding the graph edit distance.•We present RANDPOST, a framework that generates good initial solutions for local search.•We experimentally show that K-REFINE and RANDPOST perform excellently in practice.
Loading