dbblumenthal / gedlibLinks
An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.
☆62Updated last year
Alternatives and similar repositories for gedlib
Users that are interested in gedlib are comparing it to the libraries listed below
Sorting:
- Bunch of aproximated graph edit distance algorithms.☆36Updated 6 years ago
- Exact graph edit distance (GED) computation and verification☆61Updated 2 years ago
- C++ library for graph kernel and edit distance algorithm☆15Updated 6 years ago
- A python package for graph kernels, graph edit distances, and graph pre-image problem.☆125Updated this week
- A graph matching library for Python☆207Updated last year
- Data for "Understanding Isomorphism Bias in Graph Data Sets" paper.☆89Updated 5 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆54Updated 10 months ago
- Implementation of a graph edit distance in python☆34Updated 6 years ago
- Official repository for the paper "Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting" (TPAMI'22) https://arxi…☆101Updated 3 years ago
- Subgraph matching and isomorphisms in Python.☆27Updated 2 years ago
- ☆12Updated 5 years ago
- ☆25Updated 4 years ago
- A package for computing Graph Kernels☆104Updated last year
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- ☆141Updated 4 years ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆127Updated 2 years ago
- ☆351Updated 11 months ago
- ☆53Updated 5 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆70Updated 2 years ago
- Implementation of our CVPR 2021 paper "Combinatorial Learning of Graph Edit Distance via Dynamic Embedding".☆28Updated 2 years ago
- ☆149Updated 5 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆161Updated 4 years ago
- official repo for the NeurIPS 2022 paper "GREED: A Neural Framework for Learning Graph Distance Functions"☆28Updated last year
- Subgraph Neural Networks (NeurIPS 2020)☆198Updated 4 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆81Updated 9 months ago
- Source code for our AAAI paper "Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks".☆187Updated 3 years ago
- Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings☆95Updated 4 years ago
- A package for computing Graph Kernels☆33Updated 6 years ago
- Graph Diffusion Convolution, as proposed in "Diffusion Improves Graph Learning" (NeurIPS 2019)☆272Updated 2 years ago
- ☆94Updated 2 years ago