Minimum sum vertex cover: kernelization and parameterized algorithms

Yixin Cao, Ling Gai, Jingyi Liu +1

Given an ordering of the vertices of a graph, the cost of covering an edge is the smaller number of its two ends. The minimum sum vertex cover problem asks for an ordering that min…