A sampling based method for scaling graph (network) data sets.
-
Updated
Apr 27, 2022 - C++
A sampling based method for scaling graph (network) data sets.
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.
Add a description, image, and links to the graph-datasets topic page so that developers can more easily learn about it.
To associate your repository with the graph-datasets topic, visit your repo's landing page and select "manage topics."