Distributed Subgraph Enumeration via Backtracking-based Framework
-
Updated
Jan 22, 2021 - Java
Distributed Subgraph Enumeration via Backtracking-based Framework
A Java executable plugin for Neo4j: subgraph isomorphism
GRAPES-DD is a parallel software for searching substructures into a graph collection by exploiting decision diagram data structures.
A small and simple graph theory library
Running benchmarks (BI 3/4/10/11/13/14) of LDBC-SNB via VEQ algorithm
Uses reinforcement learning to train an algorithm selection model in solving subgraph isomorphism problems.
Implementation of some algorithms based on Color-Coding method by Alon-Yuster-Zwick
subgraph isomorphism based on CPI
Check to see if a mapping exists between 2 graphs (subgraph-isomorphism) by developing optimised SAT clauses and solving them using MINISAT.
Implementation of Subgraph isomorphism algorithm and optimization techniques on neo4j graph database
A distributed DucktypeSystem 🦆
Directed Multigraph Miner (DMGM)
C++ (Boost) implementation of Subgraph retrieval from given set of graphs
The code implementation of HPEC20 paper *LessMine: Reducing Sample Space and Data Access for Dense Pattern Mining*
Subgraph isomorphism using SAT Solving
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.
Source Code: Sub-GMN: Subgraph Matching Network
Add a description, image, and links to the subgraph-isomorphism topic page so that developers can more easily learn about it.
To associate your repository with the subgraph-isomorphism topic, visit your repo's landing page and select "manage topics."