Brute force enumeration (k-Clique k-Clique Problem)

From Algorithm Wiki
Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (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 == -")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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/w/index.php?title=Brute_force_enumeration_(k-Clique_k-Clique_Problem)&oldid=45704"