There are 1 repository under subgraph-isomorphism topic.
Official repository for the paper "Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting" (TPAMI'22) https://arxiv.org/abs/2006.09252
Performant, pure-Python subgraph isomorphism and monomorphism search (aka "motif search")
Neural Subgraph Matching Paper: "AEDNet: Adaptive Edge-Deleting Network For Subgraph Matching". [Neural-Subgraph-Matching Method For Learning-Subgraph-Matching. (Approximate Subgraph matching, SubgraphMatching)]
❄Implement the common subgraph isomorphism algorithms (i.e. Ullmann, VF2) based on MapReduce on Hadoop
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.
A binary and library for subgraph matching in undirected node-labeled graphs.
Subgraph isomorphism using SAT Solving
A distributed DucktypeSystem 🦆
C++ (Boost) implementation of Subgraph retrieval from given set of graphs
Running benchmarks (BI 3/4/10/11/13/14) of LDBC-SNB via VEQ algorithm
Implementation of some algorithms based on Color-Coding method by Alon-Yuster-Zwick
Uses reinforcement learning to train an algorithm selection model in solving subgraph isomorphism problems.
Check to see if a mapping exists between 2 graphs (subgraph-isomorphism) by developing optimised SAT clauses and solving them using MINISAT.
subgraph isomorphism based on CPI
A small and simple graph theory library
GRAPES-DD is a parallel software for searching substructures into a graph collection by exploiting decision diagram data structures.
A Java executable plugin for Neo4j: subgraph isomorphism
Subgraph Ismorphism Problem as SAT problem
Assignments done under course COL761-Data Mining
Subgraph Ismorphism Problem as SAT problem