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...

Celý popis

Podrobná bibliografia

Vydané v:	SIAM journal on discrete mathematics Ročník 28; číslo 4; s. 1916 - 1929
Hlavní autori:	Kanté, Mamadou Moustapha, Limouzy, Vincent, Mary, Arnaud, Nourine, Lhouari
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Society for Industrial and Applied Mathematics 01.01.2014
Predmet:	Computer Science Data Structures and Algorithms Discrete Mathematics
ISSN:	0895-4801, 1095-7146
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!