Blar i Faculty of Mathematics and Natural Sciences på emneord "enumeration"
Viser treff 1-2 av 2
-
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 ... -
Faster enumeration of minimal connected dominating sets in split graphs
(Master thesis, 2017-06-20)Graphs are mathematical objects that can be used to model many real world problems. An example is a roadmap, where the nodes in the graph represent cities and the edges of the graph represent roads. An interesting and ...