Cargando…
Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs
In this paper, we discuss parameterized algorithms for variants of the partial vertex cover problem. Recall that in the classical vertex cover problem (VC), we are given a graph [Formula: see text] and a number K and asked if we can cover all of the edges in E, using at most K vertices from V. In th...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7254907/ http://dx.doi.org/10.1007/978-3-030-48966-3_30 |