Finding a small vertex cover in massive sparse graphs
CaiShaowei, Linjinkun, LuoChuan · 2017
The problem of finding a minimum vertex cover (MinVC) in a graph is a well known NP-hard combinatorial optimization problem of great importance in theory and practice. Due to its NP-hardness, there...