Showing cs.DSShow all
3 papers · 1 filter
cs.DS2022
Reducing the Vertex Cover Number via Edge Contractions
Paloma T. Lima, Vinicius F. dos Santos, Ignasi Sau +2
The CONTRACTION(vc) problem takes as input a graph on vertices and two integers and , and asks whether one can contract at most edges to reduce the size of a min…
cs.DS2020
On structural parameterizations of the selective coloring problem
Guilherme C. M. Gomes, Vinicius F. dos Santos
In the Selective Coloring problem, we are given an integer , a graph , and a partition of into parts, and the goal is to decide whether or not we can pick exactly…
cs.DS2018
Dual parameterization of Weighted Coloring
Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima +3
Given a graph , a proper -coloring of is a partition of into stable sets . Given a weight function $w: V(G) \to \ma…