no code implementations • 1 Feb 2024 • Chanjuan Liu, Shike Ge, Zhihan Chen, Wenbin Pei, Enqiang Zhu, Yi Mei, Hisao Ishibuchi
The Critical Node Problem (CNP) is concerned with identifying the critical nodes in a complex network.
no code implementations • 25 Jul 2023 • Enqiang Zhu, Yu Zhang, Shengzhi Wang, Darren Strash, Chanjuan Liu
Given a graph, the minimum dominating set (MinDS) problem is to identify a smallest set $D$ of vertices such that every vertex not in $D$ is adjacent to at least one vertex in $D$.
no code implementations • 14 Nov 2022 • Enqiang Zhu, Xianhang Luo, Chanjuan Liu, Xiaolong Shi, Jin Xu
Although DNA computing has been exploited to solve various intractable computational problems, such as the Hamiltonian path problem, SAT problem, and graph coloring problem, there has been little discussion of designing universal DNA computing-based models, which can solve a class of problems.
no code implementations • 16 Aug 2022 • Enqiang Zhu, Yu Zhang, Chanjuan Liu
The maximum independent set (MIS) problem, a classical NP-hard problem with extensive applications in various areas, aims to find the largest set of vertices with no edge among them.
