Baidu
map

THE CONSTANT INAPPROXIMABILITY OF THE PARAMETERIZED DOMINATING SET PROBLEM

Chen, YJ; Lin, BK

Chen, YJ (reprint author), Fudan Univ, Sch Comp Sci, Shanghai, Peoples R China.

SIAM JOURNAL ON COMPUTING, 2019; 48 (2): 513

Abstract

A set D of vertices of a graph G is a dominating set if every vertex of G is contained in D or adjacent to some vertex of D. The number of vertices in......

Full Text Link


Baidu
map
Baidu
map
Baidu
map