Two Markov-Chain-Monte-Carlo-algorithms ("Glauber Dynamics" and "Flip Dynamics") used for randomly sampling k-colorings of a graph.

Project Activity

See All Activity >

License

GNU General Public License version 2.0 (GPLv2)

Follow Randomly sampling k-colorings of a graph

Randomly sampling k-colorings of a graph Web Site

Other Useful Business Software
Keep company data safe with Chrome Enterprise Icon
Keep company data safe with Chrome Enterprise

Protect your business with AI policies and data loss prevention in the browser

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

Additional Project Details

Languages

German

Intended Audience

Education, Science/Research

User Interface

Java Swing

Programming Language

Java

Related Categories

Java Simulation Software, Java Mathematics Software, Java Education Software

Registered

2007-06-05