A library for finding the maximum common induced subgraph between two graphs and compute their similarity (correlation).
-
Updated
Oct 21, 2019 - JavaScript
A library for finding the maximum common induced subgraph between two graphs and compute their similarity (correlation).
Rebalancing chemical reaction
A maximum common subgraph tool for Cytoscape
(archived) A simple chemical structure graph modeling, drawing and analysis toolkit
Finding maximum common subgraph and minimum common supergraph of two graphs
Fast iterative local search algorithm for multiple MCS detection
Documents classification using KNN Algorithm a graph based approach along with scrapped data
Add a description, image, and links to the maximum-common-subgraph topic page so that developers can more easily learn about it.
To associate your repository with the maximum-common-subgraph topic, visit your repo's landing page and select "manage topics."