Two Markov-Chain-Monte-Carlo-algorithms ("Glauber Dynamics" and "Flip Dynamics") used for randomly sampling k-colorings of a graph.
License
GNU General Public License version 2.0 (GPLv2)Follow Randomly sampling k-colorings of a graph
Other Useful Business Software
Fully Managed MySQL, PostgreSQL, and SQL Server
Cloud SQL handles your database ops end to end, so you can focus on your app.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Randomly sampling k-colorings of a graph!