Search

Purpose – The bottleneck of current DNA computing paradigms based on brute-force search strategy is that initial solution space grows exponentially with problem size, thus only trivial instances of NP-complete problem can be solved. The purpose of this paper is to present a novel molecular program based on sticker models for solving dominating set problems. Design/methodology/approach – The authors do not synthesize the initial solution pool containing every possible candidate solution as previously reported algorithm. Instead, solutions DNA molecules to the problem of interest are constructed during the course of computation. Findings – It is shown that "exponential explosions" inherent in current DNA computing paradigms may be overcome in this way. Originality/value – The paper proposes an error-resistant DNA algorithm based on sticker model for solving minimum dominating problems. [ABSTRACT FROM AUTHOR]

Abstract: Swapped Networks (SNs) are a family of two-level interconnection networks, suitable for constructing large parallel and distributed systems. In this paper, the Minimum Dominating Set (MDS) problem and the Minimum Connected Dominating Set (MCDS) problem in SNs are investigated based on the connectivity rule of SNs. We prove the two problems in SNs are -hard, and present two efficient algorithms for building dominating sets and connected dominating sets in SNs. The proposed algorithms use as input a given (connected) dominating set of the factor network, and yield a good approximation of an MDS or MCDS for the SN provided that the input is a good approximation of an MDS or MCDS for the factor network. We also derive several non-trivial bounds on the (connected) domination parameters of SNs. We believe this work is of theoretical interest in graph theory since SNs form a family of graphs. It may also motivate further research on dominating problems in SNs with their potential applications. [Copyright &y& Elsevier]