Enumerating Maximal Cliques, arbitrary graph: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

28 April 2023

10 April 2023

15 February 2023

  • curprev 10:2210:22, 15 February 2023‎ Admin talk contribs‎ 4,069 bytes +4,069‎ Created page with "{{DISPLAYTITLE:Enumerating Maximal Cliques, arbitrary graph (Clique Problems)}} == Description == A maximal clique (complete subgraph) is a clique that is not contained in any other clique. The goal here is to enumerate such maximal cliques in a given graph. == Related Problems == Related: k-Clique, Exact k-Clique, Min-Weight k-Clique, Max-Weight k-Clique == Parameters == <pre>n: number of vertices m: number of edges</pre> == Table of Algorithms..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Enumerating_Maximal_Cliques,_arbitrary_graph"