In this article an optimized method for solving problems of finding the minimum vertex covers for the arbitrary graphs based on the analysis of an unwarranted pessimistic prediction of the worst-case sample of the vertices that can be included into the cover is discussed. The effectiveness of this algorithm is shown by testing the different graph models. The time complexity, measurement errors and the possible use of this technique in the distributed environments and the telecommunication systems have also been summarized.
vertex coverage, temporal complication, functions are boole
"Optymyzyrovannыi metod reshenyia zadachy o naymenshem pokrыtyy na osnove neharantyrovannoho prohnozyrovanyia" [The optimized method for solving the minimum vertex cover problems based on a non-guaranteed prediction],
Information Processing Systems,