dbblumenthal / gedlibLinks
An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.
☆62Updated 2 years ago
Alternatives and similar repositories for gedlib
Users that are interested in gedlib are comparing it to the libraries listed below
Sorting:
- Exact graph edit distance (GED) computation and verification☆62Updated 2 years ago
- C++ library for graph kernel and edit distance algorithm☆15Updated 6 years ago
- Bunch of aproximated graph edit distance algorithms.☆36Updated 6 years ago
- ☆13Updated 6 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆54Updated 11 months ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- A python package for graph kernels, graph edit distances, and graph pre-image problem.☆126Updated 2 weeks ago
- A graph matching library for Python☆207Updated last year
- Data for "Understanding Isomorphism Bias in Graph Data Sets" paper.☆89Updated 5 years ago
- Official repository for the paper "Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting" (TPAMI'22) https://arxi…☆100Updated 4 years ago
- ☆12Updated 5 years ago
- A package for computing Graph Kernels☆104Updated last year
- ☆54Updated 5 years ago
- Implementation of our CVPR 2021 paper "Combinatorial Learning of Graph Edit Distance via Dynamic Embedding".☆28Updated 2 years ago
- ☆14Updated 10 months ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆129Updated 2 years ago
- ☆150Updated 5 years ago
- ☆95Updated 2 years ago
- ☆25Updated 4 years ago
- ☆142Updated 4 years ago
- ☆16Updated 4 years ago
- Source code for our IEEE ICDM 2017 paper "Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs".☆11Updated 7 years ago
- Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings☆95Updated 4 years ago
- ☆12Updated 8 months ago
- The official implementation of ''Can Graph Neural Networks Count Substructures?'' NeurIPS 2020☆34Updated 4 years ago
- official repo for the NeurIPS 2022 paper "GREED: A Neural Framework for Learning Graph Distance Functions"☆29Updated last year
- The code repository of paper "Computing Graph Edit Distance via Neural Graph Matching" for PVLDB 2023.☆23Updated last year
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆162Updated 4 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆157Updated last year
- Source code for our AAAI paper "Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks".☆187Updated 3 years ago