dbblumenthal / gedlib
An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.
☆59Updated last year
Alternatives and similar repositories for gedlib:
Users that are interested in gedlib are comparing it to the libraries listed below
- C++ library for graph kernel and edit distance algorithm☆15Updated 6 years ago
- Exact graph edit distance (GED) computation and verification☆56Updated 2 years ago
- A python package for graph kernels, graph edit distances, and graph pre-image problem.☆124Updated last year
- Bunch of aproximated graph edit distance algorithms.☆33Updated 6 years ago
- ☆24Updated 4 years ago
- ☆13Updated 6 years ago
- Implementation of a graph edit distance in python☆33Updated 5 years ago
- ☆49Updated 8 years ago
- ☆14Updated 7 months ago
- A package for computing Graph Kernels☆104Updated last year
- Official repository for the paper "Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting" (TPAMI'22) https://arxi…☆100Updated 3 years ago
- Subgraph matching and isomorphisms in Python.☆27Updated 2 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆53Updated 8 months ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆70Updated 2 years ago
- official repo for the NeurIPS 2022 paper "GREED: A Neural Framework for Learning Graph Distance Functions"☆27Updated last year
- Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings☆95Updated 3 years ago
- ☆52Updated 5 years ago
- ☆94Updated 2 years ago
- ☆349Updated 9 months ago
- Data for "Understanding Isomorphism Bias in Graph Data Sets" paper.☆89Updated 5 years ago
- A graph matching library for Python☆200Updated 11 months ago
- A package for computing Graph Kernels☆33Updated 6 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆82Updated 6 years ago
- Codes for TopPPR☆13Updated 5 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆86Updated 8 months ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆122Updated 2 years ago
- ☆148Updated 5 years ago
- ☆137Updated 4 years ago
- The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…☆50Updated 2 years ago
- Code for the paper: "edGNN: A simple and powerful GNN for labeled graphs"☆42Updated last year