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
Ship Agents Faster
Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Approximate Counting of Graph Colorings!