Results 331 to 340 of about 7,400,368 (352)
Some of the next articles are maybe not open access.
Dynamic dominating sets: the eviction model for eternal domination
2016In a graph \(G = (V,E)\), a dominating set \(D\) is a subset of the vertices \(V\) such that every vertex is either in \(D\) or adjacent to one. Applications of dominating sets include communications, distributed computing and security. For instance, each node in the graph represents a strategic site that needs protection, and two nodes are connected ...
Klostermeyer, William F. +2 more
openaire +1 more source
On computing a minimum secure dominating set in block graphs
Journal of combinatorial optimization, 2017D. Pradhan, A. Jha
semanticscholar +1 more source
Tight approximation bounds for dominating set on graphs of bounded arboricity
Information Processing Letters, 2017N. Bansal, S. Umboh
semanticscholar +1 more source
An Effective Hybrid Memetic Algorithm for the Minimum Weight Dominating Set Problem
IEEE Transactions on Evolutionary Computation, 2016Geng Lin, Wen-xing Zhu, Montaz M. Ali
semanticscholar +1 more source
GRASP for connected dominating set problems
Neural computing & applications (Print), 2016Ruizhi Li +5 more
semanticscholar +1 more source
A complexity dichotomy and a new boundary class for the dominating set problem
Journal of combinatorial optimization, 2016D. Malyshev
semanticscholar +1 more source