LijunChang / Graph_Edit_Distance
Exact graph edit distance (GED) computation and verification
☆54Updated 2 years ago
Alternatives and similar repositories for Graph_Edit_Distance:
Users that are interested in Graph_Edit_Distance are comparing it to the libraries listed below
- An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.☆59Updated last year
- ☆10Updated 5 years ago
- VF2 - Subgraph Isomorphism☆45Updated 4 years ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆120Updated 2 years ago
- Bunch of aproximated graph edit distance algorithms.☆33Updated 6 years ago
- ☆51Updated 4 years ago
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆198Updated 4 years ago
- GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…☆111Updated last year
- A package for computing Graph Kernels☆103Updated last year
- H2MN: Graph Similarity Learning with Hierarchical Hypergraph Matching Networks (KDD-2021)☆57Updated 2 years ago
- A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs☆27Updated 9 years ago
- ☆16Updated 4 years ago
- This is a **reimplementation** of the ICLR 2019 paper "Graph Matching Networks for Learning the Similarity of Graph Structured Objects" (…☆24Updated 4 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆53Updated 5 months ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆149Updated last year
- CFG based program similarity using Graph Neural Networks☆35Updated last year
- Code for "Multilevel Graph Matching Networks for Deep Graph Similarity Learning"☆46Updated 3 years ago
- Code for "Heterogeneous Graph Transformer" (WWW'20), which is based on Deep Graph Library (DGL)☆72Updated 2 years ago
- official repo for the NeurIPS 2022 paper "GREED: A Neural Framework for Learning Graph Distance Functions"☆27Updated last year
- ☆14Updated 5 months ago
- ☆26Updated 2 months ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 5 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆17Updated 11 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆53Updated 3 years ago
- A graph matching library for Python☆196Updated 8 months ago
- Implementation of a graph edit distance in python☆33Updated 5 years ago
- A python package for graph kernels, graph edit distances, and graph pre-image problem.☆125Updated 10 months ago
- ☆347Updated 6 months ago
- Ullman Algorithm - An Algorithm for Subgraph Isomorphism☆27Updated last year
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago