At present, the mostly used and developed mechanism is hardware
virtualization which provides a common platform to run multiple operating
systems and applications in independent partitions. More precisely, it is all
about resource virtualization as the term hardware virtualization is
emphasized. In this paper, the aim is to find out the advantages and
limitations of current virtualization techniques, analyze their cost and
performance and also depict which forthcoming hardware virtualization
techniques will able to provide efficient solutions for multiprocessor
operating systems.
Generally, a graph G, an independent set is a subset S of vertices in G such
that no two vertices in S are adjacent (connected by an edge) and a vertex
cover is a subset S of vertices such that each edge of G has at least one of
its endpoints in S. Again, the minimum vertex cover problem is to find a vertex
cover with the smallest number of vertices. This study shows that the
constrained minimum vertex cover problem in k-partite graph (MIN CVCK) is
NP-Complete which is an important property of k partite graph.