Skip to main content
Kent Academic Repository

Optimising the Volgenant–Jonker algorithm for approximating graph edit distance

Jones, William, Chawdhary, Aziem, King, Andy (2017) Optimising the Volgenant–Jonker algorithm for approximating graph edit distance. Pattern Recognition Letters, 87 . pp. 47-54. ISSN 0167-8655. (doi:10.1016/j.patrec.2016.07.024) (KAR id:56765)

Abstract

Although it is agreed that the Volgenant-Jonker (VJ) algorithm provides a fast way to approximate graph edit distance (GED), until now nobody has reported how the VJ algorithm can be tuned for this task. To this end, we revisit VJ and propose a series of refinements that improve both the speed and memory footprint without sacrificing accuracy in the GED approximation. We quantify the effectiveness of these optimisations by measuring distortion between control-flow graphs: a problem that arises in malware matching. We also document an unexpected behavioural property of VJ in which the time required to find shortest paths to unassigned vertices decreases as graph size increases, and explain how this phenomenon relates to the birthday paradox.

Item Type: Article
DOI/Identification number: 10.1016/j.patrec.2016.07.024
Subjects: Q Science
Q Science > QA Mathematics (inc Computing science)
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Andy King
Date Deposited: 08 Aug 2016 14:33 UTC
Last Modified: 05 Nov 2024 10:46 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/56765 (The current URI for this page, for reference purposes)

University of Kent Author Information

Jones, William.

Creator's ORCID:
CReDIT Contributor Roles:

Chawdhary, Aziem.

Creator's ORCID:
CReDIT Contributor Roles:

King, Andy.

Creator's ORCID: https://orcid.org/0000-0001-5806-4822
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.