# M. Chrobak and D. Eppstein (Enumerating Maximal Cliques, arbitrary graph Clique Problems)

Jump to navigation
Jump to search

## Time Complexity

$O(n d^{2} {2}^d)$

## Space Complexity

$O(n)$? words

(Keeps track of degeneracy ordering along with vertex and subset being tested (here the subset size is bounded by O(d)=O(n)))

## Description

## Approximate?

Exact

## Randomized?

No, deterministic

## Model of Computation

Word RAM

## Year

1989