Backtracking algorithm for coloring problem
2016-08-23
0 0 0
no vote
Other
Earn points
This is an algorithm written for solving the m-coloring problem. It is based on backtracking. The efficienct is relatively low. But the correctness is guaranteed. The m-coloring problem is well-known for its NP-completeness and no polynomial-time algorithm has been found yet. This problem can be applied to many pratical problems, scheduling for instance.
c++
问题
算法
Related Source Codes
Local Path Planning Algorithm - DWA Algorithm
0
0
no vote
Classic Interview Questions for Digital City Front
0
0
no vote
enDAQ-Shock-Data-Share-SRS-Blog
0
0
no vote
HDU-2553 N Queen Question
0
0
no vote
Calling chatGPT in a Windows application
0
0
no vote
No comment