On the complexity of independent dominating set with obligations in graphs
type: Item
instance of: scholarly article
title: On the complexity of independent dominating set with obligations in graphs
author: Christian Laforest
author: Timothée Martinod
published in: Theoretical Computer Science
publication date: 2022-02-01T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7467460
zbMATH Keywords: domination
zbMATH Keywords: \textit{NP}-completeness
MaRDI profile type: Publication
full work available at URL: j.tcs.2021.05.018
OpenAlex ID: W3089228560
cites work: Q3261001
cites work: Algorithms – ESA 2004
cites work: Domination problems with no conflicts
cites work: Graph problems with obligations
cites work: Q4560218
cites work: Q4198056
cites work: Q4368729
cites work: Q4368728
cites work: On approximating the minimum independent dominating set
cites work: An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions
cites work: Trees in Graphs with Conflict Edges or Forbidden Transitions
cites work: Finding Paths in Grids with Forbidden Transitions
cites work: Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs
cites work: Some Hamiltonian Properties of One-Conflict Graphs
cites work: Q5508775
cites work: Exact algorithms for dominating set
DOI: 10.1016/J.TCS.2021.05.018
description: scientific article; zbMATH DE number 7467460