Open Hub
Open Hub

 Settings |  Report Duplicate

0
I Use This!
Activity Not Available

Project Summary

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

Tags

No tags have been added

In a Nutshell, Approximate Counting of Graph Colorings...

 Code analysis has not completed

The Open Hub computes statistics on FOSS projects by examining source code and commit history in source code management systems. The source code for this project has been located, but the analysis isn't complete. Feel free to check its progress.

Quick Reference

Project Links:

Code Locations:
:pserver:anonymous:@acgc.cvs.sou...
Similar Projects:
Managers:
Become the first manager for Approximate Counting of Graph Colorings

This Project has No vulnerabilities Reported Against it

Did You Know...

  • ...
    55% of companies leverage OSS for production infrastructure
  • ...
    data presented on the Open Hub is available through our API
  • ...
    there are over 3,000 projects on the Open Hub with security vulnerabilities reported against them
  • ...
    anyone with an Open Hub account can update a project's tags

 Code analysis has not completed

The Open Hub computes statistics on FOSS projects by examining source code and commit history in source code management systems. The source code for this project has been located, but the analysis isn't complete. Feel free to check its progress.

Community Rating

Be the first to rate this project
Click to add your rating
  
Review this Project!