A linear algorithm for finding a minimum dominating set in a cactus
A cactus is a graph in which each block is either an edge or a cycle. In this paper, a linear time algorithm for finding a minimum order dominating set in a cactus is presented.
scientific article; zbMATH DE number 3959480