approximate counting of graph colorings

We have hosted the application approximate counting of graph colorings in order to run this application in our online workstations with Wine or directly.

Quick description about approximate counting of graph colorings:

Algorithms to estimate the number of k-colorings of a low-degree graph using samplings from a markov chain are provided.

Audience: Education, Science/Research.
User interface: Java Swing.
Programming Language: Java.
Categories: