On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective

In this paper, we examine variants of the partial vertex cover problem from the perspective of parameterized algorithms. Recall that in the classical vertex cover problem (VC), we are given a graph G = ⟨ V , E ⟩ and a number k and asked if we can cover all of the edges in E , using at most k vertice...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory of computing systems 2024-02, Vol.68 (1), p.122-143
Hauptverfasser:	Mkrtchyan, Vahan, Petrosyan, Garik, Subramani, K., Wojciechowski, Piotr
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Apexes Computer Science Graph theory Graphs Parameterization Parameters Theory of Computation Vertex sets Weighting functions
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!