Alternatives and similar repositories for Graph_Edit_Distance

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

• 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…
  ☆317Updated last year
• snap-stanford / neural-subgraph-learning-GNN
  ☆364Updated last year
• jacquesfize / GMatch4py
  A graph matching library for Python
  ☆209Updated last year
• betterenvi / gSpan
  Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
  ☆212Updated 5 years ago
• MiviaLab / vf3lib
  VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
  ☆134Updated 3 months ago
• MiviaLab / vf2lib
  VF2 - Subgraph Isomorphism
  ☆48Updated 3 months ago
• dbblumenthal / gedlib
  An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.
  ☆64Updated 2 years ago
• zeinaabuaisheh / Anytime_Graph_Edit_Distance
  ☆10Updated 6 years ago
• yunshengb / SimGNN
  ☆152Updated 6 years ago
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆54Updated last year
• SXKDZ / awesome-self-supervised-learning-for-graphs
  A curated list for awesome self-supervised learning for graphs.
  ☆388Updated 3 years ago
• cszhangzhen / H2MN
  H2MN: Graph Similarity Learning with Hierarchical Hypergraph Matching Networks (KDD-2021)
  ☆58Updated 3 years ago
• 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 5 years ago
• loukasa / graph-coarsening
  Multilevel graph coarsening algorithm with spectral and cut guarantees
  ☆91Updated 5 years ago
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆104Updated 2 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆164Updated 2 years ago
• jwzhanggy / Graph-Bert
  Source code of Graph-Bert
  ☆506Updated 2 years ago
• ryderling / MGMN
  Code for "Multilevel Graph Matching Networks for Deep Graph Similarity Learning"
  ☆45Updated 4 years ago
• diningphil / gnn-comparison
  Official Repository of "A Fair Comparison of Graph Neural Networks for Graph Classification", ICLR 2020
  ☆398Updated last year
• yaolili / VF2
  A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
  ☆27Updated 10 years ago
• dzambon / graph-matching-toolkit
  ☆25Updated 5 years ago
• gospodima / Extended-SimGNN
  A PyTorch Geometric implementation of SimGNN with some extensions.
  ☆64Updated 2 years ago
• jiyangbai / TaGSim
  ☆12Updated last year
• mims-harvard / SubGNN
  Subgraph Neural Networks (NeurIPS 2020)
  ☆202Updated 4 years ago
• jacquesfize / ged4py
  Implementation of a graph edit distance in python
  ☆34Updated 6 years ago
• sunfanyunn / graph-classification
  A collection of graph classification methods
  ☆42Updated 5 years ago
• yunshengb / GraphSim
  ☆56Updated 5 years ago
• ysig / GraKeL
  A scikit-learn compatible library for graph kernels
  ☆630Updated 4 months ago
• Ashish7129 / Graph_Sampling
  Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.
  ☆164Updated 5 years ago
• Thinklab-SJTU / GENN-Astar
  Implementation of our CVPR 2021 paper "Combinatorial Learning of Graph Edit Distance via Dynamic Embedding".
  ☆28Updated 3 years ago