Alternatives and similar repositories for vf2lib

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

• MiviaLab / vf3lib
  VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
  ☆127Updated 2 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆156Updated last year
• 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
• yaolili / VF2
  A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
  ☆27Updated 9 years ago
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆54Updated 10 months ago
• betterenvi / Ullman-Isomorphism
  Ullman Algorithm - An Algorithm for Subgraph Isomorphism
  ☆27Updated last year
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago
• 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
• fabiopetroni / VGP
  A software package for one-pass Vertex-cut balanced Graph Partitioning.
  ☆31Updated 9 years ago
• LijunChang / Graph_Edit_Distance
  Exact graph edit distance (GED) computation and verification
  ☆61Updated 2 years ago
• JamesWhiteSnow / GNN-PE
  ☆15Updated 7 months ago
• ehab-abdelhamid / ScaleMine
  Parallel Frequent Subgraph Mining
  ☆31Updated 7 years ago
• betterenvi / gSpan
  Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
  ☆202Updated 4 years ago
• jdmoorman / uclasm
  Subgraph matching and isomorphisms in Python.
  ☆27Updated 2 years ago
• pkumod / GSI
  GPU-friendly Subgraph Isomorphism, published in ICDE 2020
  ☆34Updated 11 months ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆27Updated 5 years ago
• zeinaabuaisheh / NetworkX_Graph_Edit_Distance
  ☆12Updated 5 years ago
• yspark-dblab / gcare
  ☆27Updated 2 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
• SNUCSE-CTA / VEQ
  ☆14Updated 3 years ago
• snap-stanford / neural-subgraph-learning-GNN
  ☆351Updated 11 months ago
• dbblumenthal / gedlib
  An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.
  ☆62Updated last year
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 6 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 years ago
• zakimjz / DistGraph
  Distributed Graph Mining on a Massive "Single" Graph
  ☆15Updated 5 years ago
• Gawssin / kCliqueListing
  a k-cliques algorithm
  ☆19Updated 3 years ago
• chenxuhao / GraphMiner
  Graph Pattern Mining
  ☆89Updated 8 months ago
• IllinoisGraphBenchmark / IGB-Datasets
  Largest realworld open-source graph dataset - Worked done under IBM-Illinois Discovery Accelerator Institute and Amazon Research Awards a…
  ☆82Updated 5 months ago
• Team309 / awesome-graph-processing
  A collection of awesome papers about graph processing.
  ☆15Updated 5 years ago