Tutorial by Topics: minimum



This is a polynomial algorithm for getting the minimum vertex cover of connected undirected graph. The time complexity of this algorithm is O(n2)


Page 1 of 1