An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion

A cactus is a connected graph that does not contain K 4 − e as a minor. Given a graph G = ( V , E ) and an integer k ≥ 0, Cactus Vertex Deletion (also known as Diamond Hitting Set ) is the problem of deciding whether G has a vertex set of size at most k whose removal leaves a forest of cacti. The pr...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory of computing systems Jg. 66; H. 2; S. 502 - 515
Hauptverfasser:	Aoike, Yuuki, Gima, Tatsuya, Hanaka, Tesshu, Kiyomi, Masashi, Kobayashi, Yasuaki, Kobayashi, Yusuke, Kurita, Kazuhiro, Otachi, Yota
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.04.2022 Springer Nature B.V
Schlagworte:	Algorithms Apexes Cacti Computer Science Deletion Diamonds Parameterization Theory of Computation Vertex sets Fixed-parameter tractable Measure and conquer analysis Cactus vertex deletion Even cycle transversal
ISSN:	1432-4350, 1433-0490
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!