There are 2 repositories under graph-isomorphism topic.
Geometric GNN Dojo provides unified implementations and experiments to explore the design space of Geometric Graph Neural Networks.
This repository contains PyTorch implementation of the following paper: "Order Matters: Probabilistic Modeling of Node Sequence for Graph Generation"
A Haskell library of GRaph Algorithms and Data Structures
Scott is a python library to compute, for any fully-labelled (edge and node) graph, a canonical tree representative of its isomorphism class, that can be derived into a canonical trace (string) or adjacency matrix
The lib CBioInfCpp.h contains 3 groups of functions for C++: "Input-Output", "Working with strings", "Working with graphs". Data structures "Adjacency vector" and "Adjacency map" are implemented in the last one (i.e. in "Working with graphs"). See About_CBioInfCpp for details.
Graphdatabase Matching Framework for NEO4J
A state of the art algorithm for the Graph Isomorphism problem, adjusted for Sub-Graph and Induced Sub-Graph Isomorphism and extended to directed and multigraph settings.
Test graph isomorphism with 1-WL for different graph classes and labelings
Implementation of the algorithm described in the paper "On the Power of Color Refinement".
detect isomorphisms and generate all distinct graphs
Automorphic Equivalence-aware Graph Neural Network. NeurIPS 2021.
Implementation of graph isomorphism search
Frequent Subgraph Mining and Graph Classification
Use the bispectrum on the symmetric group to solve graph isomorphism.
Ausarbeitung für das Seminar Algorithm Engineering an der TU Dortmund zum Paper "On the Power of Color Refinement" von Arvind et al.
Software Development @ Atlantic Technological University : Heapsort algorithm and Graph Isomorphism Problem Jupyter Notebook for Graph Theory Module
Official implementation for paper "10X Faster Subgraph Matching: Dual Matching Networks with Interleaved Diffusion Attention"
Rematch: Robust and Efficient Matching of Local Knowledge Graphs for Improved Structural and Semantic Similarity
An efficient generator of functional digraphs up to isomorphism
Graph isomorphism problem solver in polynomial time.
A lightweight 2D graph library in Java
A graph isomorphism program that checks the isomorphism of two graphs and calculates their automorphism group.
quick and dirty code for finding isomorphic (edge structure based) directed semantic graphs
Novel quantum annealing optimization algorithm to solve graph/subrgraph isomorphism problem, in the use case of code clone detection.
Identify graph isomorphisms with HD computing.
Spectral graph theory algorithms in Python