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
  ☆48Updated 3 months ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆164Updated 2 years ago
• MiviaLab / vf3lib
  VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
  ☆134Updated 3 months ago
• dbblumenthal / gedlib
  An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.
  ☆64Updated 2 years ago
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆54Updated last year
• ZongyueQin / Graph-Hashing
  ☆16Updated 5 years ago
• jdmoorman / uclasm
  Subgraph matching and isomorphisms in Python.
  ☆28Updated 3 years ago
• LijunChang / Graph_Edit_Distance
  Exact graph edit distance (GED) computation and verification
  ☆68Updated 3 years ago
• russellizadi / ssp
  ☆96Updated 2 years ago
• snap-stanford / neural-subgraph-learning-GNN
  ☆364Updated 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…
  ☆117Updated 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…
  ☆50Updated 2 years ago
• yunshengb / SimGNN
  ☆152Updated 6 years ago
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆104Updated 2 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆109Updated 2 years ago
• 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
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆88Updated 6 years ago
• kfoynt / LocalGraphClustering
  ☆144Updated 4 years ago
• dzambon / graph-matching-toolkit
  ☆25Updated 5 years ago
• jacquesfize / ged4py
  Implementation of a graph edit distance in python
  ☆34Updated 6 years ago
• betterenvi / gSpan
  Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
  ☆212Updated 5 years ago
• saurabhdash / GCN_Partitioning
  Graph Partitoning Using Graph Convolutional Networks
  ☆66Updated 3 years ago
• yunshengb / GraphSim
  ☆56Updated 5 years ago
• jinhongjung / pyrwr
  Python Implementation for Random Walk with Restart (RWR)
  ☆122Updated 3 years ago
• chrsmrrs / k-gnn
  Source code for our AAAI paper "Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks".
  ☆190Updated 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
• loukasa / graph-coarsening
  Multilevel graph coarsening algorithm with spectral and cut guarantees
  ☆91Updated 5 years ago
• cornell-zhang / GraphZoom
  GraphZoom: A Multi-level Spectral Approach for Accurate and Scalable Graph Embedding (ICLR'20 Oral)
  ☆114Updated 2 years ago
• Lin-Yijie / Graph-Matching-Networks
  PyTorch implementation of Graph Matching Networks, e.g., Graph Matching with Bi-level Noisy Correspondence (COMMON, ICCV 2023), Graph Mat…
  ☆317Updated last year
• yangji9181 / HNE
  Heterogeneous Network Embedding: Survey, Benchmark, Evaluation, and Beyond
  ☆260Updated 4 years ago