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
Stop vibe-debugging.
AppSignal's MCP server hands Claude, Cursor, or Zed your real errors, traces, and the deploy that shipped them. AI writes the fix; you review the diff.
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!