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
• priba / aproximated_ged
  Bunch of aproximated graph edit distance algorithms.
  ☆35Updated 6 years ago
• zeinaabuaisheh / Anytime_Graph_Edit_Distance
  ☆10Updated 5 years ago
• MiviaLab / vf2lib
  VF2 - Subgraph Isomorphism
  ☆45Updated 5 years ago
• zeinaabuaisheh / NetworkX_Graph_Edit_Distance
  ☆12Updated 5 years ago
• yunshengb / GraphSim
  ☆53Updated 5 years ago
• cszhangzhen / H2MN
  H2MN: Graph Similarity Learning with Hierarchical Hypergraph Matching Networks (KDD-2021)
  ☆58Updated 3 years ago
• ryderling / MGMN
  Code for "Multilevel Graph Matching Networks for Deep Graph Similarity Learning"
  ☆48Updated 3 years ago
• yunshengb / SimGNN
  ☆149Updated 5 years ago
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆53Updated 9 months ago
• Indradyumna / ISONET
  ☆26Updated 6 months ago
• MiviaLab / vf3lib
  VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
  ☆126Updated 2 years ago
• dzambon / graph-matching-toolkit
  ☆25Updated 4 years ago
• jacquesfize / GMatch4py
  A graph matching library for Python
  ☆206Updated last year
• jacquesfize / ged4py
  Implementation of a graph edit distance in python
  ☆34Updated 6 years ago
• idea-iitd / greed
  official repo for the NeurIPS 2022 paper "GREED: A Neural Framework for Learning Graph Distance Functions"
  ☆28Updated last year
• betterenvi / gSpan
  Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
  ☆202Updated 4 years ago
• ZongyueQin / Graph-Hashing
  ☆16Updated 4 years ago
• 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…
  ☆304Updated 7 months ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• gospodima / Extended-SimGNN
  A PyTorch Geometric implementation of SimGNN with some extensions.
  ☆60Updated 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
• snap-stanford / neural-subgraph-learning-GNN
  ☆351Updated 10 months ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆157Updated last year
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆104Updated last year
• ChengzhiPiao / GEDGNN
  The code repository of paper "Computing Graph Edit Distance via Neural Graph Matching" for PVLDB 2023.
  ☆21Updated last year
• JongikKim / Nass
  ☆14Updated 9 months 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
• jdmoorman / uclasm
  Subgraph matching and isomorphisms in Python.
  ☆27Updated 2 years ago
• jiyangbai / TaGSim
  ☆12Updated 7 months ago