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
You Might Also Like
Red Hat Enterprise Linux (RHEL) on Microsoft Azure provides a secure, reliable, and flexible foundation for your cloud infrastructure. Red Hat Enterprise Linux on Microsoft Azure is ideal for enterprises seeking to enhance their cloud environment with seamless integration, consistent performance, and comprehensive support.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Approximate Counting of Graph Colorings!