Search Results for author:
Found 5 papers, 0 papers with code
Improving Critical Node Detection Using Neural Network-based Initialization in a Genetic Algorithm
The Critical Node Problem (CNP) is concerned with identifying the critical nodes in a complex network.
A Dual-mode Local Search Algorithm for Solving the Minimum Dominating Set Problem
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$.
A universal DNA computing model for solving NP-hard subset problems
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.
An Adaptive Repeated-Intersection-Reduction Local Search for the Maximum Independent Set Problem
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.
Preference at First Sight
We focus on how short sight affects the logical properties of decision making in multi-agent settings.
