Seyed Mahmood Hashemi, Jingsha He, Alireza Ebrahimi Basabi, "An Approach for Network Security with Graph Coloring Problem," WSEAS Transactions on Communications, vol. 16, pp. 14-20, 2017, DOI:
Seyed Mahmood Hashemi, Jingsha He, Alireza Ebrahimi Basabi. An Approach for Network Security with Graph Coloring Problem.
WSEAS Transactions on Communications. 2017;16:14-20.
WSEAS Transactions on Communications
Print ISSN: 1109-2742, E-ISSN: 2224-2864
Volume 16, 2017
An Approach for Network Security with Graph Coloring Problem
Authors: , ,
Abstract: Modeling of network security is useful approach to comprehend the status. In this paper, network is modeled in a graph. Security problem is solved in graph as Graph Coloring Problem (GCP). In GCP, two adjacent nodes must have different colors. Thus GCP provides the security in the network. One objective in GCP is chromatic number and another objective is total price. We present a multi-objective problem for GCP in this paper. Defined problem is solved with multi-objective simulated annealing and multi-objective imperialist competitive algorithm.
Pages: 14-20 WSEAS Transactions on Communications, ISSN / E-ISSN: 1109-2742 / 2224-2864, Volume 16, 2017, Art. #3 DOI: *As the DOI is a unique identifier, it is already available in the pdf version.
**The DOI link will be activated in the first midst of January 2026.
×
Citation Tools