This is a repository of the code used for the experimental work in my Bachelor thesis on Approximation Algorithms for Graph Edit Distance (GED). It includes implementations, benchmarking scripts, and evaluation methods for comparing GED approximation algorithms with exact computations.
pythonbenchmarkingcplusplusreproducible-researchgraphsgraph-matchingheuristic-algorithmcomputational-complexityexperimental-designapproximation-algorithmsgnnsgraph-neural-networksgraph-similaritygraph-edit-distancealgorithm-performancegraph-datasetsgedlib
-
Updated
Jan 5, 2026 - C++