@Book{806818689,
author="Nevries, Ragnar Christopher",
title="Efficient domination and polarity",
year="2014",
abstract="The thesis considers the following graph problems: Efficient (Edge) Domination seeks for an independent vertex (edge) subset D such that all other vertices (edges) have exactly one neighbor in D. Polarity asks for a vertex subset that induces a complete multipartite graph and that contains a vertex of every induced P{\_}3. Monopolarity is the special case of Polarity where the wanted vertex subset has to be independent. These problems are NP-complete in general, but efficiently solvable on various graph classes. The thesis sharpens known NP-completeness results and presents new solvable cases.",
note="vorgelegt von Ragnar Christopher Nevries",
note="Rostock, Univ., Fak. f{\"u}r Informatik und Elektrotechnik, Diss., 2014",
url="http://rosdok.uni-rostock.de/resolve?urn=urn:nbn:de:gbv:28-diss2014-0183-3",
url="http://rosdok.uni-rostock.de/resolve?urn=urn:nbn:de:gbv:28-diss2014-0183-3&pdf",
url="http://nbn-resolving.de/urn:nbn:de:gbv:28-diss2014-0183-3",
language="English"
}