• Medientyp: E-Book; Hochschulschrift
  • Titel: Efficient domination and polarity
  • Beteiligte: Nevries, Ragnar Christopher [Verfasser:in]
  • Erschienen: 2014
  • Umfang: Online-Ressource; graph. Darst
  • Sprache: Englisch
  • Identifikator:
  • RVK-Notation: ST 134 : Algorithmen-, Komplexitätstheorie
  • Schlagwörter: Effizienter Algorithmus > NP-vollständiges Problem
  • Entstehung:
  • Hochschulschrift: Rostock, Univ., Fak. für Informatik und Elektrotechnik, Diss., 2014
  • Anmerkungen:
  • Beschreibung: 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.
  • Zugangsstatus: Freier Zugang