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
Keep company data safe with Chrome Enterprise
Make AI work your way with Chrome Enterprise. Block unapproved sites and set custom data controls that align with your company's policies.
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!