0
I Use This!
Inactive
Analyzed about 5 hours ago. based on code collected about 5 hours ago.

Project Summary

Two Markov-Chain-Monte-Carlo-algorithms ("Glauber Dynamics" and "Flip Dynamics") used for randomly sampling k-colorings of a graph.

Tags

No tags have been added

In a Nutshell, Randomly sampling k-colorings of a graph...

This Project has No vulnerabilities Reported Against it

Did You Know...

  • ...
    Black Duck offers a free trial so you can discover if there are open source vulnerabilities in your code
  • ...
    check out hot projects on the Open Hub
  • ...
    there are over 3,000 projects on the Open Hub with security vulnerabilities reported against them
  • ...
    search using multiple tags to find exactly what you need

Languages

Languages?height=75&width=75
Java
99%
XML
1%

30 Day Summary

Jul 20 2018 — Aug 19 2018

12 Month Summary

Aug 19 2017 — Aug 19 2018

Ratings

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