On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem

We study the parameterized complexity of the Bounded-Degree Vertex Deletion problem (BDD), where the aim is to find a maximum induced subgraph whose maximum degree is below a given degree bound. Our focus lies on parameters that measure the structural properties of the input instance. We first show...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 83; číslo 1; s. 297 - 336
Hlavní autori:	Ganian, Robert, Klute, Fabian, Ordyniak, Sebastian
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.01.2021 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Deletion Feedback Graph theory Mathematics of Computing Parameterization Parameters Theory of Computation Vertex sets Treecut width Parameterized algorithms Feedback vertex set Bounded-degree vertex deletion
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!