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
  ☆47Updated 2 months ago
• MiviaLab / vf3lib
  VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
  ☆134Updated last month
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆160Updated 2 years ago
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆54Updated last year
• dbblumenthal / gedlib
  An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.
  ☆64Updated 2 years ago
• LijunChang / Graph_Edit_Distance
  Exact graph edit distance (GED) computation and verification
  ☆67Updated 3 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆89Updated 6 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…
  ☆117Updated last year
• kfoynt / LocalGraphClustering
  ☆144Updated 4 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…
  ☆50Updated 2 years ago
• adrian-lison / gnn-community-detection
  Graph Neural Networks for Community Detection
  ☆64Updated 5 years ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆32Updated 4 years ago
• snap-stanford / neural-subgraph-learning-GNN
  ☆362Updated last year
• jdmoorman / uclasm
  Subgraph matching and isomorphisms in Python.
  ☆28Updated 2 years ago
• yaolili / VF2
  A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
  ☆27Updated 9 years ago
• Ashish7129 / Graph_Sampling
  Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.
  ☆163Updated 4 years ago
• russellizadi / ssp
  ☆96Updated 2 years ago
• jinhongjung / pyrwr
  Python Implementation for Random Walk with Restart (RWR)
  ☆122Updated 2 years ago
• TrustAGI-Lab / graph_datasets
  A Repository of Benchmark Graph Datasets for Graph Classification (31 Graph Datasets In Total).
  ☆293Updated 3 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago
• yunshengb / SimGNN
  ☆152Updated 6 years ago
• Sunarker / GAT-for-PPI
  The code of Graph Attention Networks for Cora, Citeseer, Pubmed and PPI
  ☆35Updated 6 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆109Updated 2 years ago
• shionhonda / gae-dgl
  Reimplementation of Graph Autoencoder by Kipf & Welling with DGL.
  ☆63Updated 2 years ago
• ZongyueQin / Graph-Hashing
  ☆16Updated 5 years ago
• betterenvi / gSpan
  Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
  ☆208Updated 4 years ago
• Gkunnan97 / FastGCN_pytorch
  an implementation of FastGCN with pytorch
  ☆51Updated 5 years ago
• guowentian / dynamicppr
  The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"
  ☆25Updated 7 years ago
• loukasa / graph-coarsening
  Multilevel graph coarsening algorithm with spectral and cut guarantees
  ☆92Updated 5 years ago
• yhtang / GraphDot
  GPU-accelerated Marginalized Graph Kernel with customizable node and edge features; Gaussian process regression.
  ☆22Updated last year