Degree Department
Month
Day
1 Matching Results
Results open in a new window/tab.
Results:
1 - 1 of
1
A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph
Article implements and tests the performances of several approximation algorithms for computing the minimum dominating set of a graph. This article belongs to the Special Issue: Algorithms for Hard Graph Problems.
Date:
December 14, 2020
Creator:
Shahrokhi, Farhad; Li, Jonathan & Potru, Rohan
System:
The UNT Digital Library