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
$300 Free Credits to Build on Google Cloud
Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
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!