Alternatives and similar repositories for Ullman-Isomorphism

Users that are interested in Ullman-Isomorphism 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.
  ☆64Updated 2 years ago
• MiviaLab / vf2lib
  VF2 - Subgraph Isomorphism
  ☆48Updated 4 months ago
• MiviaLab / vf3lib
  VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
  ☆136Updated 4 months ago
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆53Updated last year
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆164Updated 2 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…
  ☆51Updated 2 years ago
• ZongyueQin / Graph-Hashing
  ☆16Updated 5 years ago
• jinhongjung / pyrwr
  Python Implementation for Random Walk with Restart (RWR)
  ☆122Updated 3 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆88Updated 6 years ago
• yhtang / GraphDot
  GPU-accelerated Marginalized Graph Kernel with customizable node and edge features; Gaussian process regression.
  ☆22Updated last year
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆30Updated 6 years ago
• russellizadi / ssp
  ☆96Updated 2 years ago
• snap-stanford / neural-subgraph-learning-GNN
  ☆366Updated last year
• Ashish7129 / Graph_Sampling
  Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.
  ☆164Updated 5 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…
  ☆119Updated 2 years ago
• yunshengb / GraphSim
  ☆56Updated 5 years ago
• LijunChang / Graph_Edit_Distance
  Exact graph edit distance (GED) computation and verification
  ☆68Updated 3 years ago
• yaolili / VF2
  A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
  ☆27Updated 10 years ago
• betterenvi / gSpan
  Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
  ☆214Updated 5 years ago
• TrustAGI-Lab / graph_datasets
  A Repository of Benchmark Graph Datasets for Graph Classification (31 Graph Datasets In Total).
  ☆296Updated 3 years ago
• acbull / HGT-DGL
  Code for "Heterogeneous Graph Transformer" (WWW'20), which is based on Deep Graph Library (DGL)
  ☆75Updated 3 years ago
• chrsmrrs / k-gnn
  Source code for our AAAI paper "Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks".
  ☆189Updated 3 years ago
• snap-stanford / distance-encoding
  Distance Encoding for GNN Design
  ☆188Updated 4 years ago
• yunshengb / SimGNN
  ☆152Updated 6 years ago
• Oceanusity / awesome-gnns-on-large-scale-graphs
  ☆138Updated 2 years ago
• wuhao-wu-jiang / Personalized-PageRank
  ☆14Updated 4 years ago
• mengliu1998 / awesome-deep-gnn
  Papers about developing deep Graph Neural Networks (GNNs)
  ☆296Updated 2 years ago
• JongikKim / Nass
  ☆14Updated last year
• cszhangzhen / H2MN
  H2MN: Graph Similarity Learning with Hierarchical Hypergraph Matching Networks (KDD-2021)
  ☆59Updated 3 years ago
• AaltoPML / Rethinking-pooling-in-GNNs
  ☆62Updated 5 years ago