Algorithm PMinVertexCover (graph G)
Input connected graph G
Output Minimum Vertex Cover Set C
Set C <- new Set<Vertex>()
Set X <- new Set<Vertex>()
X <- G.getAllVerticiesArrangedDescendinglyByDegree()
for v in X do
List<Vertex> adjacentVertices1 <- G....
