2 papers
cs.DM2021
On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs
Vahan Mkrtchyan, Garik Petrosyan
In the classical partial vertex cover problem, we are given a graph and two positive integers and . The goal is to check whether there is a subset of of size at…
cs.DM2019
Parameterized algorithms for Partial vertex covers in bipartite graphs
Vahan Mkrtchyan, Garik Petrosyan, K. Subramani
In the weighted partial vertex cover problem (WPVC), we are given a graph , cost function , profit function , and positive integers …