Analyzed algorithmic efficiency of three approaches to solving the minimum vertex cover for undirected graphs of various sizes.