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

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 630; pp. 63 - 75
Main Authors:	Golovach, Petr A., Heggernes, Pinar, Kratsch, Dieter
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 30.05.2016 Elsevier
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!