Minimum cover dominating set application
-
Updated
May 17, 2020 - Python
#
cs170
Here are 6 public repositories matching this topic...
Given a graph of |V| students, |E| friendships, B buses, and L "troublemaker groups", assign all the students to buses in a way that maintains as many friendships as possible! Code and project reports for a maximally-connected, K-clusters approximation algorithm which uses the NetworkX library.
-
Updated
Dec 18, 2018 - Python
Solutions to UC Berkeley CS170 Efficient Algorithms and Intractable Problems — rigorous homework write-ups plus implemented algorithms and the coding project
-
Updated
Jul 5, 2026 - Jupyter Notebook
Add this topic to your repo
To associate your repository with the cs170 topic, visit your repo's landing page and select "manage topics."