fvictorio/dominating_set
Sequential and parallel code to compute the size of the smallest dominating set of a given graph, using C++ and openmp.
My solutions to some Project Eulers problems.
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
Sequential and parallel code to compute the size of the smallest dominating set of a given graph, using C++ and openmp.
Statistical classification library
Some solved problems from uva.onlinejudge.org
Solutions to the Ninety-Nine Haskell Problems