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
Veeam Data Platform v13.1 - Get Your Free Trial Icon
Veeam Data Platform v13.1 - Get Your Free Trial

Secure by design, portable by default. Recover clean, fast, anywhere. Start a free trial.

Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
Try it Free
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