Chiba and Nishizeki (Enumerating Maximal Cliques, arbitrary graph Clique Problems): 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.

10 April 2023

15 February 2023

  • curprev 12:1512:15, 15 February 2023‎ Admin talk contribs‎ 422 bytes +422‎ Created page with "== Time Complexity == $O(a(G)*m)$ per clique == Space Complexity == $O(m)$ auxiliary words (https://pdfs.semanticscholar.org/0d19/245a27bc65a87a8014d5b8a66fb514c8ff0b.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1985 == Reference == https://pdfs.semanticscholar.org/0d19/245a27bc65a87a8014d5b8a66fb514c8ff0b.pdf"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Chiba_and_Nishizeki_(Enumerating_Maximal_Cliques,_arbitrary_graph_Clique_Problems)"