Report copyright - Finding A Small Vertex Cover in Massive Sparse Graphs ... · The problem of finding a minimum vertex cover (MinVC) in a graph is a well known NP- ... (also MaxIS and Maximum Clique)
Please pass captcha verification before submit form