DeepAI
Chat Image GeneratorImage Video Music Voice Chat Photo Editor Website BuilderBeta
Pricing

Simulated Annealing Algorithm for Graph Coloring

12/03/2017
∙
by   Alper Kose, et al.
∙
0
∙

The goal of this Random Walks project is to code and experiment the Markov Chain Monte Carlo (MCMC) method for the problem of graph coloring. In this report, we present the plots of cost function H by varying the parameters like q (Number of colors that can be used in coloring) and c (Average node degree). The results are obtained by using simulated annealing scheme, where the temperature (inverse of β) parameter in the MCMC is lowered progressively.

READ FULL TEXT

Please sign up or login with your details

Continue with:
Or login with email
Enter Password
Re-enter Password

Forgot password? Click here to reset

Out of credits

Add credits to your account

Automatically add credits when your balance is low. Never run out again!
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro

Subscribe to DeepAI Pro
DeepAI Pro
Provides a limited generation allowance each month. When exceeded, you are charged overage rates available at deepai.org/pricing. Also includes an ad-free experience and API access. Renews automatically until canceled. Non-refundable.
Subtotal
Total due today

By subscribing, you authorize Deep AI, Inc. to charge you according to the terms until you cancel.
Terms · Privacy

Payment
Add DeepAI credits
DeepAI credits
One-time purchase. Credits are added to your wallet after payment.
Subtotal
Total due today

Terms · Privacy

Payment