A Linear Kernel for Planar Total Dominating Set

A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ such that every vertex in $V$ is adjacent to some vertex in $D$. Finding a total dominating set of minimum size is NP-hard on planar graphs and W[2]-complete on general graphs when parameterized by the solution size. By the meta...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Discrete Mathematics and Theoretical Computer Science Ročník 20 no. 1; číslo Discrete Algorithms; s. 1
Hlavní autori:	Garnero, Valentin, Sau, Ignasi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	DMTCS 01.05.2018 Discrete Mathematics & Theoretical Computer Science
Predmet:	05c85, 05c10 computer science - data structures and algorithms Fuzzy sets g.2.2 Graph theory Kernel functions Mathematical research Mathematics Set theory France Data Structures and Algorithms
ISSN:	1365-8050, 1462-7264, 1365-8050
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!