Enumerating minimal connected dominating sets in graphs of bounded chordality

Enumerating objects of specified type is one of the principal tasks in algorithmics. In graph algorithms one often enumerates vertex subsets satisfying a certain property. We study the enumeration of all minimal connected dominating sets of an input graph from various graph classes of bounded chorda...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 630; s. 63 - 75
Hlavní autori:	Golovach, Petr A., Heggernes, Pinar, Kratsch, Dieter
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 30.05.2016 Elsevier
Predmet:	Algorithms Automatic Engineering Sciences Enumeration Exact exponential algorithms Graph theory Graphs Minimal connected dominating sets Tasks Upper bounds Exact exponential algorithms Minimal connected dominating sets Enumeration
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!