Algorithms to estimate the number of k-colorings of a low-degree graph using samplings from a markov chain are provided.
Be the first to post a text review of Approximate Counting of Graph Colorings. Rate and review a project by clicking thumbs up or thumbs down in the right column.
This is the first release of the Approximate Counting of Graph Coloring algorithms. It is bundled with one test graph stored in a GraphML-file and instructions on how to use the application.
First version of Approximate Counting of Graph Colorings algorithmus is released as a bundle that comes with a test graph and brief instructions on how to use the application.
Be the first person to add a text review.
Copyright © 2009 Geeknet, Inc. All rights reserved. Terms of Use
Thanks for your rating!
Would you also like to write a review?