maximum-common-subgraph (npm): An algorithm to construct the maximum common subgraph between two graphs (networks) and find their similarity (correlation).
Keywords: maximum common induced subgraph|maximum common subgraph|maximum-common-subgraph|maximum_common_subgraph|graph|network|similarity|correlation