Alternatives and similar repositories for Graph_Edit_Distance:

Users that are interested in Graph_Edit_Distance are comparing it to the libraries listed below

• dbblumenthal / gedlib
  An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.
  ☆60Updated last year
• zeinaabuaisheh / NetworkX_Graph_Edit_Distance
  ☆10Updated 5 years ago
• zeinaabuaisheh / Anytime_Graph_Edit_Distance
  ☆10Updated 5 years ago
• dzambon / graph-matching-toolkit
  ☆24Updated 4 years ago
• MiviaLab / vf2lib
  VF2 - Subgraph Isomorphism
  ☆45Updated 4 years ago
• yunshengb / GraphSim
  ☆52Updated 5 years ago
• ZongyueQin / Graph-Hashing
  ☆16Updated 4 years ago
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆104Updated last year
• yunshengb / SimGNN
  ☆149Updated 5 years ago
• cszhangzhen / H2MN
  H2MN: Graph Similarity Learning with Hierarchical Hypergraph Matching Networks (KDD-2021)
  ☆58Updated 3 years ago
• yaolili / VF2
  A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
  ☆27Updated 9 years ago
• idea-iitd / greed
  official repo for the NeurIPS 2022 paper "GREED: A Neural Framework for Learning Graph Distance Functions"
  ☆27Updated last year
• jacquesfize / GMatch4py
  A graph matching library for Python
  ☆203Updated 11 months ago
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆53Updated 8 months ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• priba / aproximated_ged
  Bunch of aproximated graph edit distance algorithms.
  ☆34Updated 6 years ago
• Ashish7129 / Graph_Sampling
  Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.
  ☆161Updated 4 years ago
• ehab-abdelhamid / GraMi
  GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…
  ☆112Updated last year
• ryderling / MGMN
  Code for "Multilevel Graph Matching Networks for Deep Graph Similarity Learning"
  ☆48Updated 3 years ago
• MiviaLab / vf3lib
  VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
  ☆124Updated 2 years ago
• jacquesfize / ged4py
  Implementation of a graph edit distance in python
  ☆33Updated 5 years ago
• acbull / HGT-DGL
  Code for "Heterogeneous Graph Transformer" (WWW'20), which is based on Deep Graph Library (DGL)
  ☆73Updated 2 years ago
• ColinConduff / FrequentSubgraphMining
  This is a python implementation of the Gaston frequent subgraph mining algorithm.
  ☆20Updated 5 years ago
• jdmoorman / uclasm
  Subgraph matching and isomorphisms in Python.
  ☆27Updated 2 years ago
• betterenvi / gSpan
  Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
  ☆201Updated 4 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆155Updated last year
• jajupmochi / graphkit-learn
  A python package for graph kernels, graph edit distances, and graph pre-image problem.
  ☆124Updated last year
• nghiahhnguyen / Graph-Matching-Networks-PyTorch
  This is a **reimplementation** of the ICLR 2019 paper "Graph Matching Networks for Learning the Similarity of Graph Structured Objects" (…
  ☆23Updated 4 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 6 years ago
• chrsmrrs / k-gnn
  Source code for our AAAI paper "Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks".
  ☆187Updated 3 years ago