Blar i Department of Informatics på emneord "minimal connected dominating sets"
Viser treff 1-1 av 1
-
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 ...