dbblumenthal / gedlib
An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.
☆60Updated last year
Alternatives and similar repositories for gedlib:
Users that are interested in gedlib are comparing it to the libraries listed below
- Exact graph edit distance (GED) computation and verification☆58Updated 2 years ago
- Bunch of aproximated graph edit distance algorithms.☆34Updated 6 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.☆124Updated 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"☆53Updated 9 months ago
- Code for "Heterogeneous Graph Transformer" (WWW'20), which is based on Deep Graph Library (DGL)☆74Updated 2 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☆104Updated last year
- ☆53Updated 5 years ago
- Multilevel graph coarsening algorithm with spectral and cut guarantees☆88Updated 4 years ago
- A graph matching library for Python☆206Updated last year
- ☆149Updated 5 years ago
- Official repository for the paper "Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting" (TPAMI'22) https://arxi…☆100Updated 3 years ago
- Source code for our AAAI paper "Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks".☆187Updated 3 years ago
- ☆13Updated 6 years ago
- ☆351Updated 10 months ago
- Distance Encoding for GNN Design☆187Updated 4 years ago
- Subgraph Neural Networks (NeurIPS 2020)☆194Updated 4 years ago
- Subgraph matching and isomorphisms in Python.☆27Updated 2 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆70Updated 2 years ago
- ☆14Updated 8 months ago
- ☆94Updated 2 years ago
- ☆10Updated 5 years ago
- Implementation of a graph edit distance in python☆34Updated 6 years ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆126Updated 2 years ago
- HDGI code☆61Updated 5 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆157Updated last year
- ☆24Updated 4 years ago
- ☆138Updated 4 years ago