Browsing Department of Informatics by Subject "enumeration algorithms"
Now showing items 1-1 of 1
-
Improved Combinatorial Bounds and Enumerators for the Connected Vertex Cover and Independent Feedback Vertex Set Problems
(Master thesis, 2018-06-20)In this thesis we shall study both the maximum number of minimal connected vertex covers and the maximum number of minimal independent feedback vertex sets in graphs. A subset S of the vertices of a graph G is a vertex ...