Alternatives and similar repositories for Ullman-Isomorphism:

Users that are interested in Ullman-Isomorphism are comparing it to the libraries listed below

• MiviaLab / vf2lib
  VF2 - Subgraph Isomorphism
  ☆45Updated 4 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆155Updated last year
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆53Updated 9 months 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
• MiviaLab / vf3lib
  VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
  ☆124Updated 2 years ago
• yaolili / VF2
  A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
  ☆27Updated 9 years 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
• guowentian / dynamicppr
  The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"
  ☆25Updated 7 years ago
• JongikKim / Nass
  ☆14Updated 8 months ago
• ZongyueQin / Graph-Hashing
  ☆16Updated 4 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆110Updated last year
• athomo / kcore
  ☆11Updated 7 years ago
• yspark-dblab / gcare
  ☆27Updated 2 years ago
• Team309 / awesome-graph-processing
  A collection of awesome papers about graph processing.
  ☆15Updated 5 years ago
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆45Updated 5 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• LijunChang / Graph_Edit_Distance
  Exact graph edit distance (GED) computation and verification
  ☆57Updated 2 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆25Updated 3 years ago
• anilpacaci / streaming-graph-partitioning
  Experimental Setup for Performance Analysis of Streaming Algorithms
  ☆31Updated 3 years ago
• JamesWhiteSnow / GNN-PE
  ☆15Updated 5 months ago
• dbblumenthal / gedlib
  An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.
  ☆60Updated last year
• wuhao-wu-jiang / Personalized-PageRank
  ☆13Updated 3 years ago
• IllinoisGraphBenchmark / IGB-Datasets
  Largest realworld open-source graph dataset - Worked done under IBM-Illinois Discovery Accelerator Institute and Amazon Research Awards a…
  ☆82Updated 4 months ago
• Gawssin / kCliqueListing
  a k-cliques algorithm
  ☆19Updated 3 years ago
• ChengzhiPiao / GEDGNN
  The code repository of paper "Computing Graph Edit Distance via Neural Graph Matching" for PVLDB 2023.
  ☆20Updated last year
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated last year
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆27Updated 5 years ago
• mayerrn / hybrid_edge_partitioner
  ☆18Updated 3 years ago
• jinhongjung / pyrwr
  Python Implementation for Random Walk with Restart (RWR)
  ☆120Updated 2 years ago