Find maximal clique of each input graph, plus a maximal common induced subgraph of all input graphs.
-
Updated
Dec 22, 2023 - C
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 bron-kerbosch-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the bron-kerbosch-algorithm topic, visit your repo's landing page and select "manage topics."