thus permitting the automatic deduction of cost functions for graph edit distance [2]. Parallel efforts have improved classical bipartite matching approaches by reducing run times without ...