A PyTorch implementation of "SimGNN: A Neural Network Approach to Fast Graph Similarity Computation" (WSDM 2019).
-
Updated
Jan 12, 2023 - Python
A PyTorch implementation of "SimGNN: A Neural Network Approach to Fast Graph Similarity Computation" (WSDM 2019).
A python package for graph kernels, graph edit distances, and graph pre-image problem.
A PyTorch Geometric implementation of SimGNN with some extensions.
Code for "Multilevel Graph Matching Networks for Deep Graph Similarity Learning"
Quantifying Pairwise Chemical Similarity for Polymers
A Python/Cython package for graph edit distances and graph matching
A Jupyter notebook for a project centered around 'Group Recommendation Systems (GRS)' utilizing the 'GcPp' clustering approach.
[AAAI 2025] GraSP: Simple yet Effective Graph Similarity Predictions
Calculating Pairwise Similarity of Polymer Ensembles via Earth Mover’s Distance
Build a supergraph of a dataset
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-edit-distance topic page so that developers can more easily learn about it.
To associate your repository with the graph-edit-distance topic, visit your repo's landing page and select "manage topics."