Alternatives and similar repositories for vf3lib

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

• MiviaLab / vf2lib
  VF2 - Subgraph Isomorphism
  ☆45Updated 5 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆156Updated last year
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆54Updated 10 months ago
• JamesWhiteSnow / GNN-PE
  ☆15Updated 7 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
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• snap-stanford / neural-subgraph-learning-GNN
  ☆351Updated 11 months ago
• LijunChang / Graph_Edit_Distance
  Exact graph edit distance (GED) computation and verification
  ☆61Updated 2 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago
• jdmoorman / uclasm
  Subgraph matching and isomorphisms in Python.
  ☆27Updated 2 years ago
• betterenvi / Ullman-Isomorphism
  Ullman Algorithm - An Algorithm for Subgraph Isomorphism
  ☆27Updated last year
• RapidsAtHKUST / ContinuousSubgraphMatching
  Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…
  ☆49Updated 2 years ago
• yaolili / VF2
  A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
  ☆27Updated 9 years ago
• dbblumenthal / gedlib
  An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.
  ☆62Updated last year
• yspark-dblab / gcare
  ☆27Updated 2 years ago
• Kangfei / LSS
  Released code for [sigmod'21] A learned Sketch for Subgraph Counting
  ☆18Updated 3 years ago
• JackChuengQAQ / SubgraphMatchingSurvey
  The source code of "A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction"
  ☆13Updated 9 months ago
• jacquesfize / GMatch4py
  A graph matching library for Python
  ☆207Updated last year
• XuanzhouLiu / D2Match-ICML23
  Implementation of paper "D2Match: Leveraging Deep Learning and Degeneracy for Subgraph Matching"
  ☆12Updated last year
• jiyangbai / TaGSim
  ☆12Updated 7 months ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 6 years ago
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆27Updated 5 years ago
• SNUCSE-CTA / VEQ
  ☆14Updated 3 years ago
• betterenvi / gSpan
  Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
  ☆202Updated 4 years ago
• zeinaabuaisheh / NetworkX_Graph_Edit_Distance
  ☆12Updated 5 years ago
• fabiopetroni / VGP
  A software package for one-pass Vertex-cut balanced Graph Partitioning.
  ☆31Updated 9 years ago
• thocevar / orca
  ORbit Counting Algorithm
  ☆38Updated 8 years ago
• wzskytop / TopPPR
  Codes for TopPPR
  ☆13Updated 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
• ciaranm / glasgow-subgraph-solver
  A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.
  ☆81Updated this week