Alternatives and similar repositories for Ullman-Isomorphism

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

• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆159Updated 2 years ago
• 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 2 months 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
• 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
• betterenvi / gSpan
  Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
  ☆210Updated 4 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
• russellizadi / ssp
  ☆96Updated 2 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆109Updated 2 years ago
• yunshengb / SimGNN
  ☆152Updated 6 years ago
• jdmoorman / uclasm
  Subgraph matching and isomorphisms in Python.
  ☆28Updated 3 years ago
• kfoynt / LocalGraphClustering
  ☆144Updated 4 years ago
• shionhonda / gae-dgl
  Reimplementation of Graph Autoencoder by Kipf & Welling with DGL.
  ☆63Updated 2 years ago
• yifan-h / PGE
  A Representation Learning Framework for Property Graphs
  ☆11Updated 5 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago
• saurabhdash / GCN_Partitioning
  Graph Partitoning Using Graph Convolutional Networks
  ☆66Updated 3 years ago
• yaolili / VF2
  A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
  ☆27Updated 9 years ago
• JongikKim / Nass
  ☆14Updated last year
• Gkunnan97 / FastGCN_pytorch
  an implementation of FastGCN with pytorch
  ☆51Updated 5 years ago
• yunshengb / GraphSim
  ☆56Updated 5 years ago
• IllinoisGraphBenchmark / IGB-Datasets
  Largest realworld open-source graph dataset - Worked done under IBM-Illinois Discovery Accelerator Institute and Amazon Research Awards a…
  ☆85Updated 5 months ago
• guowentian / dynamicppr
  The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"
  ☆25Updated 7 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
• 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
• ZongyueQin / Graph-Hashing
  ☆16Updated 5 years ago
• mayerrn / hybrid_edge_partitioner
  ☆18Updated 4 years ago
• Oceanusity / awesome-gnns-on-large-scale-graphs
  ☆138Updated 2 years ago
• YuxiangRen / Heterogeneous-Deep-Graph-Infomax
  HDGI code
  ☆63Updated 5 years ago
• leichen2018 / GNN-Substructure-Counting
  The official implementation of ''Can Graph Neural Networks Count Substructures?'' NeurIPS 2020
  ☆35Updated 4 years ago