View source for APSP algorithm (3-Clique Min-Weight k-Clique Problem)

← APSP algorithm (3-Clique Min-Weight k-Clique Problem)

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in the group: Users.

You can view and copy the source of this page.

== Time Complexity == 

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

== Space Complexity == 

 words

()

== Description == 



== Approximate? == 

Exact

== Randomized? == 

No, deterministic

== Model of Computation == 

Word RAM

== Year == 

-

== Reference == 

-

Return to APSP algorithm (3-Clique Min-Weight k-Clique Problem).

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/APSP_algorithm_(3-Clique_Min-Weight_k-Clique_Problem)"

Navigation menu