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
Get the most trusted enterprise browser Icon
Get the most trusted enterprise browser

Advanced built-in security helps IT prevent breaches before they happen

Defend against security incidents with Chrome Enterprise. Create customizable controls, manage extensions and set proactive alerts to keep your data and employees protected without slowing down productivity.
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