Randomly sampling k-colorings of a graph

planning
Add a Review
0 Downloads (This Week)
Last Update:
  Browse Code CVS Repository

Description

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

Randomly sampling k-colorings of a graph Web Site

Update Notifications





Write a Review

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

Registered

2007-06-04
Screenshots can attract more users to your project.
Features can attract more users to your project.

Icons must be PNG, GIF, or JPEG and less than 1 MiB in size. They will be displayed as 48x48 images.