Alternatives and similar repositories for Graph_Edit_Distance

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

• betterenvi / gSpan
  Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
  ☆204Updated 4 years ago
• dbblumenthal / gedlib
  An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.
  ☆64Updated 2 years ago
• MiviaLab / vf2lib
  VF2 - Subgraph Isomorphism
  ☆47Updated 5 years ago
• jacquesfize / GMatch4py
  A graph matching library for Python
  ☆207Updated last year
• Lin-Yijie / Graph-Matching-Networks
  PyTorch implementation of Graph Matching Networks, e.g., Graph Matching with Bi-level Noisy Correspondence (COMMON, ICCV 2023), Graph Mat…
  ☆307Updated 10 months ago
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆54Updated last year
• yaolili / VF2
  A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
  ☆27Updated 9 years ago
• ryderling / MGMN
  Code for "Multilevel Graph Matching Networks for Deep Graph Similarity Learning"
  ☆46Updated 3 years ago
• snap-stanford / neural-subgraph-learning-GNN
  ☆356Updated last year
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆104Updated 2 years ago
• cszhangzhen / H2MN
  H2MN: Graph Similarity Learning with Hierarchical Hypergraph Matching Networks (KDD-2021)
  ☆58Updated 3 years ago
• dzambon / graph-matching-toolkit
  ☆25Updated 4 years ago
• MiviaLab / vf3lib
  VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
  ☆130Updated 3 weeks 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…
  ☆114Updated last year
• yunshengb / SimGNN
  ☆151Updated 5 years ago
• gospodima / Extended-SimGNN
  A PyTorch Geometric implementation of SimGNN with some extensions.
  ☆61Updated 2 years ago
• zeinaabuaisheh / NetworkX_Graph_Edit_Distance
  ☆12Updated 5 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆88Updated 6 years ago
• jajupmochi / graphkit-learn
  A python package for graph kernels, graph edit distances, and graph pre-image problem.
  ☆128Updated 2 months ago
• zeinaabuaisheh / Anytime_Graph_Edit_Distance
  ☆10Updated 5 years ago
• yunshengb / GraphSim
  ☆55Updated 5 years ago
• ysig / GraKeL
  A scikit-learn compatible library for graph kernels
  ☆625Updated 2 weeks ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆159Updated last year
• TrustAGI-Lab / graph_datasets
  A Repository of Benchmark Graph Datasets for Graph Classification (31 Graph Datasets In Total).
  ☆290Updated 3 years ago
• SXKDZ / awesome-self-supervised-learning-for-graphs
  A curated list for awesome self-supervised learning for graphs.
  ☆388Updated 2 years ago
• ZongyueQin / Graph-Hashing
  ☆16Updated 4 years ago
• Ashish7129 / Graph_Sampling
  Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.
  ☆162Updated 4 years ago
• chrsmrrs / k-gnn
  Source code for our AAAI paper "Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks".
  ☆188Updated 3 years ago
• loukasa / graph-coarsening
  Multilevel graph coarsening algorithm with spectral and cut guarantees
  ☆90Updated 5 years ago
• priba / aproximated_ged
  Bunch of aproximated graph edit distance algorithms.
  ☆36Updated 7 years ago