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.
python benchmarking cplusplus reproducible-research graphs graph-matching heuristic-algorithm computational-complexity experimental-design approximation-algorithms gnns graph-neural-networks graph-similarity graph-edit-distance algorithm-performance graph-datasets gedlib
-
Updated
Jan 5, 2026 - C++