Spectral graph theory algorithms in Python
-
Updated
Oct 2, 2021 - Python
Spectral graph theory algorithms in Python
Graph Isomorphism Testing with Multiprocessing: 2 single-threaded and 2 multi-threaded algorithms
One-shot Graph Isomorphism
Official implementation for paper "10X Faster Subgraph Matching: Dual Matching Networks with Interleaved Diffusion Attention"
Qubit mapping with subgraph isomorphism, based on VF2 and VF2++.
Rematch: Robust and Efficient Matching of Local Knowledge Graphs for Improved Structural and Semantic Similarity
A (proof of concept) generator of functional digraphs up to isomorphism
Automorphic Equivalence-aware Graph Neural Network. NeurIPS 2021.
detect isomorphisms and generate all distinct graphs
Test graph isomorphism with 1-WL for different graph classes and labelings
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.
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
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."