15 papers
Exact Optimization for Minimum Dominating Sets
Enqiang Zhu, Qiqi Bao, Yu Zhang +2
The Minimum Dominating Set (MDS) problem is a well-established combinatorial optimization problem with numerous real-world applications. Its NP-hard nature makes it increasingly di…
Cohesive Group Discovery in Interaction Graphs under Explicit Density Constraints
Yu Zhang, Yilong Luo, Mingyuan Ma +4
Discovering cohesive groups is a fundamental primitive in graph-based recommender systems, underpinning tasks such as social recommendation, bundle discovery, and community-aware m…
HyColor: An Efficient Heuristic Algorithm for Graph Coloring
Enqiang Zhu, Yu Zhang, Haopeng Sun +4
The graph coloring problem (GCP) is a classic combinatorial optimization problem that aims to find the minimum number of colors assigned to vertices of a graph such that no two adj…
Dynamic Location Search for Identifying Maximum Weighted Independent Sets in Complex Networks
Enqiang Zhu, Chenkai Hao, Chanjuan Liu +1
While Artificial intelligence (AI), including Generative AI, are effective at generating high-quality traffic data and optimization solutions in intelligent transportation systems…
GRALS: GCN-Guided Redundancy-Aware Local Search for Minimum Vertex Cover
Chanjuan Liu, Qiqi Bao, Yu Zhang +1
The minimum vertex cover (MVC) problem seeks to identify the smallest set of vertices that cover all edges in an undirected graph. As a fundamental NP-hard combinatorial optimizati…
Boosting drug-disease association prediction for drug repositioning via dual-feature extraction and cross-dual-domain decoding
Enqiang Zhu, Xiang Li, Chanjuan Liu +1
The extraction of biomedical data has significant academic and practical value in contemporary biomedical sciences. In recent years, drug repositioning, a cost-effective strategy f…
Improving Critical Node Detection Using Neural Network-based Initialization in a Genetic Algorithm
Chanjuan Liu, Shike Ge, Zhihan Chen +4
The Critical Node Problem (CNP) is concerned with identifying the critical nodes in a complex network. These nodes play a significant role in maintaining the connectivity of the ne…
A Dual-mode Local Search Algorithm for Solving the Minimum Dominating Set Problem
Enqiang Zhu, Yu Zhang, Shengzhi Wang +2
Given a graph, the minimum dominating set (MinDS) problem is to identify a smallest set of vertices such that every vertex not in is adjacent to at least one vertex in .…
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…
Mining Large Independent Sets on Massive Graphs
Yu Zhang, Witold Pedrycz, Chanjuan Liu +1
The Maximum Independent Set problem is fundamental for extracting conflict-free structure from large graphs, with applications in scheduling, recommendation, and network analysis.…
PHEE: A phased hybrid evaluation-enhanced approach for identifying influential users in social networks
Enqiang Zhu, Haosen Wang, Yu Zhang +2
For the purpose of maximizing the spread of influence caused by a certain small number k of nodes in a social network, we are asked to find a k-subset of nodes (i.e., a seed set) w…
Metric dimension and edge metric dimension of unicyclic graphs
Enqiang Zhu, Shaoxiang Peng, Chanjuan Liu
The metric (resp. edge metric) dimension of a simple connected graph , denoted by dim (resp. edim), is the cardinality of a smallest vertex subset fo…
Notes on k-rainbow independent domination in graphs
Enqiang Zhu, Chanjuan Liu
The -rainbow independent domination number of a graph , denoted , is the cardinality of a smallest set consisting of two vertex-disjoint independent sets $V_1…
On a Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable
Enqiang Zhu, Chanjuan Liu, Yongsheng Rao
A total -coloring of a graph is an assignment of colors to its vertices and edges such that no two adjacent or incident elements receive the same color. The Total Coloring C…
Preference at First Sight
Chanjuan Liu
We consider decision-making and game scenarios in which an agent is limited by his/her computational ability to foresee all the available moves towards the future - that is, we stu…