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...

Celý popis

Podrobná bibliografia

Vydané v:	Theory of computing systems Ročník 66; číslo 2; s. 502 - 515
Hlavní autori:	Aoike, Yuuki, Gima, Tatsuya, Hanaka, Tesshu, Kiyomi, Masashi, Kobayashi, Yasuaki, Kobayashi, Yusuke, Kurita, Kazuhiro, Otachi, Yota
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.04.2022 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!