Search Results for "graph isomorphism"

Spektral is a Python library for graph deep learning, based on the Keras API and TensorFlow 2. The main goal of this project is to provide a simple but flexible framework for creating graph neural networks (GNNs). You can use Spektral for classifying the users of a social network, predicting molecular properties, generating new graphs with GANs, clustering nodes, predicting links, and any other task where data is described by graphs. Spektral implements some of the most popular layers for...

This is a method for identifying graphs using MD5 hashing. It can be used for graph equality comparisons and to facilitate graph isomorphism testing. The graphs can be labeled or unlabeled.

This project aims to develop and share fast frequent subgraph mining and graph learning algorithms. Currently we release the frequent subgraph mining package FFSM and later we will include new functions for graph regression and classification package

Graph isomorphism algorithm in polynomial complexity(O(n*n*n). it consume less than 1 second to judge Graph of 800 vertice in general.

The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance.

Griso is a graph isomorphism testing utility written in C++. It is based on my own POLYNOMIAL-TIME (in this point the salt of the project) algorithm. See Griso's sample input/output on http://funkybee.narod.ru/graphs.htm page. Edit (2012-10-24): seems so far it works for *regular graphs only* and should be tested on such graphs. Edit (2012-10-25): see two counterexamples in README.txt.

A Common Lisp library for representing and manipulating graphs. Algorithms implemented: subgraph isomorphism (Ullman), automorphism, canonicalization (Nauty), connected-components/union-find.

Java port of the Nauty utility for graph isomorphism testing

Small Feynman diagram generator written in Python. The graph isomorphism algorithm is borrowed from Bliss.