On the Enumeration of Minimal Dominating Sets and Related Notions

A dominating set ${D}$ in a graph is a subset of its vertex set such that each vertex is either in ${D}$ or has a neighbor in ${D}$. In this paper, we are interested in the enumeration of (inclusionwise) minimal dominating sets in graphs, called the Dom-Enum problem. It is well known that this probl...

Full description

Bibliographic Details

Published in:	SIAM journal on discrete mathematics Vol. 28; no. 4; pp. 1916 - 1929
Main Authors:	Kanté, Mamadou Moustapha, Limouzy, Vincent, Mary, Arnaud, Nourine, Lhouari
Format:	Journal Article
Language:	English
Published:	Society for Industrial and Applied Mathematics 01.01.2014
Subjects:	Computer Science Data Structures and Algorithms Discrete Mathematics
ISSN:	0895-4801, 1095-7146
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!