Blar i Department of Informatics på emneord "lower bound"
Viser treff 1-2 av 2
-
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 ... -
New Lower Bounds on the Maximum Number of Minimal Connected Vertex Covers
(Master thesis, 2017-06-20)Graphs are important mathematical structures that are used to model many real-life problems. They can, for instance, be used to model relations between objects in a network. An important field of study in graph theory is ...