2 papers
q-bio.MN2022
A universal DNA computing model for solving NP-hard subset problems
Enqiang Zhu, Xianhang Luo, Chanjuan Liu +2
DNA computing, a nontraditional computing mechanism, provides a feasible and effective method for solving NP-hard problems because of the vast parallelism and high-density storage…
math.CO2018
Changing and unchanging 2-rainbow independent domination
Pu Wu, Zehui Shao, Vladimir Samodivkin +3
For a function we denote by the set of vertices to which the value is assigned by , i.e. . If…