Enumerating minimal dominating sets in chordal graphs
type: Item
instance of: scholarly article
title: Enumerating minimal dominating sets in chordal graphs
zbMATH Open document ID: 1371.05127
author: Faisal N. Abu-Khzam
author: Pinar Heggernes
published in: Information Processing Letters
publication date: 2016-08-16T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6617212
zbMATH Keywords: input sensitive enumeration
zbMATH Keywords: branching algorithm
zbMATH Keywords: maximum number of minimal dominating sets
zbMATH Keywords: chordal graphs
zbMATH Keywords: graph algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2016.07.002
OpenAlex ID: W2487741757
cites work: Graph Classes: A Survey
cites work: Minimal dominating sets in graph classes: combinatorial bounds and enumeration
cites work: On the number of minimal dominating sets on some graph classes
cites work: On rigid circuit graphs
cites work: Exact exponential algorithms.
cites work: Algorithmic graph theory and perfect graphs
cites work: On the Enumeration of Minimal Dominating Sets and Related Notions
DOI: 10.1016/J.IPL.2016.07.002
description: scientific article; zbMATH DE number 6617212