Browsing Faculty of Mathematics and Natural Sciences by Subject "upper bound"
Now showing items 12 of 2

Faster enumeration of minimal connected dominating sets in split graphs
(The University of Bergen, 20170620)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 ...Master thesis 
New Lower Bounds on the Maximum Number of Minimal Connected Vertex Covers
(The University of Bergen, 20170620)Graphs are important mathematical structures that are used to model many reallife problems. They can, for instance, be used to model relations between objects in a network. An important field of study in graph theory is ...Master thesis