Improved local search for graph edit distance

Nicolas Boria,David B. Blumenthal,Sébastien Bougleux,Luc Brun

Pattern Recognition Letters（2020）

引用 16|浏览0

暂无评分

摘要

•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.

查看译文

关键词

Graph edit distance,Local search,Stochastic warm start

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要