Complexity and Algorithms for Domination in Graphs

Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In this chapter, we provide an overviewof some of the core results on NP-completeness and algorithms for domination, independent domination, and total domination in graphs.

Original languageEnglish
Title of host publicationSpringer Monographs in Mathematics
PublisherSpringer Science and Business Media Deutschland GmbH
Pages49-72
Number of pages24
DOIs
Publication statusPublished - 2023

Publication series

NameSpringer Monographs in Mathematics
ISSN (Print)1439-7382
ISSN (Electronic)2196-9922

ASJC Scopus subject areas

  • General Mathematics

Fingerprint

Dive into the research topics of 'Complexity and Algorithms for Domination in Graphs'. Together they form a unique fingerprint.

Cite this