D. Graph Algorithm in Computer Network Security
The vertex cover algorithm (Given as input a
simple graph G with n vertices labelled 1, 2, …, n,
search for a vertex cover of size at most k. At each
stage, if the vertex cover obtained the size at most
k, then stop. Simulate the propagation of stealth
worms on large computer networks and design
optimal strategies to protect the network against
virus attacks in real time. Simulation is carried out
in large internet like virtual network and showed
that the topology routing has big impact on worm
propagation [9]. The importance of finding the
worm propagation is to hinder them in real time.
The main idea here is to find a minimum vertex
cover in the graph whose vertices are the routing
servers and the edges are the connections between
the routing servers. Then an optimal solution is
found for worm propagation and a network defence
strategy is defined. In a graph G, a set of edges g is
said to cover G if every vertex in G is incident on
at least one edge in g. The set of edges that covers