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

Full description

Bibliographic Details

Published in:	Discrete Mathematics and Theoretical Computer Science Vol. 20 no. 1; no. Discrete Algorithms; p. 1
Main Authors:	Garnero, Valentin, Sau, Ignasi
Format:	Journal Article
Language:	English
Published:	DMTCS 01.05.2018 Discrete Mathematics & Theoretical Computer Science
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!