Search Results for author:
Found 1 papers, 0 papers with code
Graph edit distance : a new binary linear programming formulation
Moreover, a relaxation of the domain constraints in the formulations provides efficient lower bound approximations of the GED.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
