Geometric GNN Dojo provides unified implementations and experiments to explore the design space of Geometric Graph Neural Networks (ICML 2023)

VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs

The GAP package Digraphs

This repository contains PyTorch implementation of the following paper: "Order Matters: Probabilistic Modeling of Node Sequence for Graph Generation"

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

A Haskell library of GRaph Algorithms and Data Structures

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.

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.

Graphdatabase Matching Framework for NEO4J

Test graph isomorphism with 1-WL for different graph classes and labelings

A (proof of concept) generator of functional digraphs up to isomorphism

Frequent Subgraph Mining and Graph Classification

Use the bispectrum on the symmetric group to solve graph isomorphism.

Rematch: Robust and Efficient Matching of Local Knowledge Graphs for Improved Structural and Semantic Similarity

detect isomorphisms and generate all distinct graphs

Automorphic Equivalence-aware Graph Neural Network. NeurIPS 2021.

Implementation of graph isomorphism search

Implementation of the algorithm described in the paper "On the Power of Color Refinement".

Software Development @ Atlantic Technological University : Heapsort algorithm and Graph Isomorphism Problem Jupyter Notebook for Graph Theory Module