graph-isomorphism topic

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

MiviaLab

The GAP package Digraphs

digraphs

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 adj...

theplatypus

A Haskell library of GRaph Algorithms and Data Structures

biocad

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

tufts-ml

Geometric GNN Dojo provides unified implementations and experiments to explore the design space of Geometric Graph Neural Networks.

chaitjo