Brute force enumeration (k-Clique k-Clique Problem): 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.

    15 February 2023

    • curprev 12:1812:18, 15 February 2023‎ Admin talk contribs‎ 298 bytes +298‎ Created page with "== Time Complexity == $O(n^k)$ == Space Complexity == $O(k)$ auxiliary words (keeping track of which vertices we're looking at) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == - == Reference == -"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Brute_force_enumeration_(k-Clique_k-Clique_Problem)"