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