Gronlund, Pettie (3-Clique Exact-Weight k-Clique Problem)

From Algorithm Wiki
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