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
Outgrown Windows Task Scheduler? Icon
Outgrown Windows Task Scheduler?

Free diagnostic identifies where your workflow is breaking down—with instant analysis of your scheduling environment.

Windows Task Scheduler wasn't built for complex, cross-platform automation. Get a free diagnostic that shows exactly where things are failing and provides remediation recommendations. Interactive HTML report delivered in minutes.
Download Free Tool
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