Bron–Kerbosch algorithm (Enumerating Maximal Cliques, arbitrary graph Clique Problems): 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.

10 April 2023

15 February 2023

  • curprev 12:1512:15, 15 February 2023‎ Admin talk contribs‎ 389 bytes +389‎ Created page with "== Time Complexity == $O({3}^{(n/{3})})$ == Space Complexity == $O(n^{2})$ auxiliary? words (Keep track of an O(n)-sized recursive stack with O(n)-sized lists as elements?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1973 == Reference == https://dl.acm.org/doi/10.1145/362342.362367"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Bron–Kerbosch_algorithm_(Enumerating_Maximal_Cliques,_arbitrary_graph_Clique_Problems)"