A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph (open access)

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