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

On the Power of Choice for k-Colorability of Random Graphs.

Varsha DaniDiksha GuptaThomas P. Hayes
Published in: APPROX-RANDOM (2021)
Keyphrases
  • random graphs
  • phase transition
  • graph theoretic
  • learning curves
  • power consumption
  • constraint satisfaction
  • undirected graph
  • small world
  • np complete
  • complex networks
  • search algorithm
  • power law