• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

The worst-case time complexity for generating all maximal cliques and computational experiments.

Etsuji TomitaAkira TanakaHaruhisa Takahashi
Published in: Theor. Comput. Sci. (2006)
Keyphrases
  • maximal cliques
  • worst case time complexity
  • graph theoretic
  • graph theory
  • space complexity
  • maximum clique
  • bayesian networks
  • constraint programming
  • arc consistency
  • association graph
  • maximal clique enumeration