maximum-common-subgraph
An algorithm to construct the maximum common subgraph between two graphs (networks) and find their similarity (correlation).
An algorithm to construct the maximum common subgraph between two graphs (networks) and find their similarity (correlation).