An Approach for Network Security with Graph Coloring Problem
Seyed Mahmood Hashemi, Jingsha He, Alireza Ebrahimi Basabi · WSEAS TRANSACTIONS on COMMUNICATIONS archive · 2017
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.