A dichotomy for weighted efficient dominating sets with bounded degree vertices
type: Item
instance of: scholarly article
title: A dichotomy for weighted efficient dominating sets with bounded degree vertices
zbMATH Open document ID: 1469.68073
author: Andreas Brandstädt
author: Martin Milanič
published in: Information Processing Letters
publication date: 2018-12-05T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6989084
zbMATH Keywords: weighted efficient domination
zbMATH Keywords: bounded degree vertices
zbMATH Keywords: \(k\)-bounded weighted efficient domination
zbMATH Keywords: polynomial-time algorithm
zbMATH Keywords: graph algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2018.10.007
OpenAlex ID: W2896652362
cites work: Q3815323
cites work: Generalized domination and efficient domination in graphs
cites work: Perfect codes in graphs
cites work: Efficient domination and efficient edge domination: a brief survey
cites work: Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
cites work: New Polynomial Cases of the Weighted Efficient Domination Problem
cites work: Weighted independent perfect domination on cocomparability graphs
cites work: Q4017197
cites work: Q4198056
cites work: Reducibility among Combinatorial Problems
cites work: Q4892794
cites work: Q4249540
cites work: Q5284096
cites work: Weighted efficient domination problem on some perfect graphs
cites work: Hereditary Efficiently Dominatable Graphs
cites work: The weighted perfect domination problem and its variants
DOI: 10.1016/J.IPL.2018.10.007
description: scientific article; zbMATH DE number 6989084