Blar i Department of Informatics på emneord "Minimal connected dominating set"
Viser treff 1-1 av 1
-
Enumerating minimal connected dominating sets in graphs of bounded chordality
(Peer reviewed; Journal article, 2015)Listing, generating or 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 ...