In this paper, a new binary linear programming formulation for computing the exact Graph Edit Distance (GED) between two graphs is proposed. A fundamental strength of the formulations lies in their genericity since the GED can be computed between directed or undirected fully attributed graphs. Moreo...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!