Algorithms to estimate the number of k-colorings of a low-degree graph using samplings from a markov chain are provided.
License
GNU General Public License version 2.0 (GPLv2)Follow Approximate Counting of Graph Colorings
Other Useful Business Software
$300 Free Credits to Build on Google Cloud
Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Approximate Counting of Graph Colorings!