In graph theory, a dominating set for a graph $G$ is a subset $D$ of its vertices, such that any vertex of $G$ is in $D$, or has a neighbor in $D$. The minimum ...
The surface-based DNA computing is one of the methods of DNA computing which uses DNA strands immobilized on a solid surface. In this paper, we applied surface-based DNA computing for solving the ...
C. Archetti, F. Carrabs, R. Cerulli, The Set Orienteering Problem, European Journal of Operational Research, Volume 267(1), pp. 264 - 272, 2018. Francesco Carrabs, A Biased Random-Key Genetic ...
Abstract: Motivated by power system cyber–physical security applications, this article investigates a variant of the connected dominating set problem called the relaxed connected dominating set (RCDS) ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback