Login / Signup

Finding large cliques in sparse semi-random graphs by simple randomized search heuristics.

Tobias Storch
Published in: Theor. Comput. Sci. (2007)
Keyphrases
  • random graphs
  • search heuristics
  • constraint programming
  • graph theoretic
  • random variables
  • community structure
  • beam search
  • neural network
  • search algorithm
  • web search
  • markov chain