1 citations · 1 across the 1 of their papers we have counts for
1 paper
Jonathan S. Li, Rohan Potru, Farhad Shahrokhi
We implement and test the performances of several approximation algorithms for computing the minimum dominating set of a graph. These algorithms are the standard greedy algorithm,…