Gronlund, Pettie (3-Clique Exact-Weight 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^{3}*(log log n)$^{2}/(log n)) == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2014 == Reference == https://ieeexplore.ieee.org/abstract/document/6979047")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n^{3}*(log log n)$^{2}/(log n))

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2014

Reference

https://ieeexplore.ieee.org/abstract/document/6979047

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Gronlund,_Pettie_(3-Clique_Exact-Weight_k-Clique_Problem)&oldid=45705"