This repository contains work towards creating a comprehensive cross-platform graph processing benchmark for Community Detection and Subgraph Isomorphism problems. The repository is NOT YET COMPLETE and should not be used outside of a preliminary development perspective.
https://github.com/UMD-ARLIS/Graph-Benchmarking-Project/tree/cleaned_branch/Code/Graph_Problems/GraphMatching does not follow the Structure SOP and needs to be updated to the correct format.