Chemical Reaction Optimization for Minimum Weight Dominating Set
Dominating set of a graph can be defined as the set of vertices that can cover all other vertices of the graph. The minimum weight dominating set (MWDS) is the minimum number of vertices in the dominating set with minimum total weight. In recent times, the chemical reaction optimization algorithm (C...
Saved in:
| Main Authors: | A. Pritam Khan Boni, B. Md. Rafiqul Islam |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-01-01
|
| Series: | Applied Computational Intelligence and Soft Computing |
| Online Access: | http://dx.doi.org/10.1155/2023/9640807 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Solving the maximum cut problem using Harris Hawk Optimization algorithm.
by: Md Rafiqul Islam, et al.
Published: (2024-01-01) -
A Greedy Algorithm on Constructing the Minimum Connected Dominating Set in Wireless Network
by: Deqian Fu, et al.
Published: (2016-07-01) -
Minimum Neighborhood Domination of Split Graph of Graphs
by: ANJALINE. W, et al.
Published: (2023-03-01) -
An improved DV-Hop localization with minimum connected dominating set for mobile nodes in wireless sensor networks
by: Gulshan Kumar, et al.
Published: (2018-01-01) -
Inequalities for the Minimum Eigenvalue of Doubly Strictly Diagonally Dominant M-Matrices
by: Ming Xu, et al.
Published: (2014-01-01)