Mining the common subgraph in a group of graphs.
-
Updated
Aug 18, 2018 - Python
Mining the common subgraph in a group of graphs.
Find maximal clique of each input graph, plus a maximal common induced subgraph of all input graphs.
Add a description, image, and links to the common-subgraph topic page so that developers can more easily learn about it.
To associate your repository with the common-subgraph topic, visit your repo's landing page and select "manage topics."