Login / Signup

The Analysis of a List-Coloring Algorithm on a Random Graph.

Dimitris AchlioptasMichael S. O. Molloy
Published in: FOCS (1997)
Keyphrases
  • random graphs
  • dynamic programming
  • computational complexity
  • k means
  • learning algorithm
  • objective function
  • np hard
  • probabilistic model
  • data analysis
  • shortest path
  • clustering method
  • tree structure
  • undirected graph