Implementation of the algorithm described in the paper "On the Power of Color Refinement".
-
Updated
Mar 21, 2017 - C++
Implementation of the algorithm described in the paper "On the Power of Color Refinement".
Graphdatabase Matching Framework for NEO4J
A lightweight 2D graph library in Java
detect isomorphisms and generate all distinct graphs
Identify graph isomorphisms with HD computing.
Ausarbeitung für das Seminar Algorithm Engineering an der TU Dortmund zum Paper "On the Power of Color Refinement" von Arvind et al.
Frequent Subgraph Mining and Graph Classification
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
Implementation of graph isomorphism search
quick and dirty code for finding isomorphic (edge structure based) directed semantic graphs
Graph Isomorphism Testing with Multiprocessing: 2 single-threaded and 2 multi-threaded algorithms
Spectral graph theory algorithms in Python
Automorphic Equivalence-aware Graph Neural Network. NeurIPS 2021.
Use the bispectrum on the symmetric group to solve graph isomorphism.
Graph isomorphism problem solver in polynomial time.
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.
VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
This repository contains PyTorch implementation of the following paper: "Order Matters: Probabilistic Modeling of Node Sequence for Graph Generation"
Add a description, image, and links to the graph-isomorphism topic page so that developers can more easily learn about it.
To associate your repository with the graph-isomorphism topic, visit your repo's landing page and select "manage topics."