subgraph-isomorphism
Here are 7 public repositories matching this topic...
GRAPES-DD is a parallel software for searching substructures into a graph collection by exploiting decision diagram data structures.
-
Updated
Mar 24, 2021 - C++
Implementation of some algorithms based on Color-Coding method by Alon-Yuster-Zwick
-
Updated
Feb 4, 2019 - C++
Check to see if a mapping exists between 2 graphs (subgraph-isomorphism) by developing optimised SAT clauses and solving them using MINISAT.
-
Updated
Nov 27, 2016 - C++
C++ (Boost) implementation of Subgraph retrieval from given set of graphs
-
Updated
Oct 28, 2021 - C++
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.
-
Updated
Jan 8, 2024 - C++
Improve this page
Add a description, image, and links to the subgraph-isomorphism topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the subgraph-isomorphism topic, visit your repo's landing page and select "manage topics."