Now showing items 1-2 of 2

    • Enumerating minimal connected dominating sets in graphs of bounded chordality 

      Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter (Dagstuhl Publishing, 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 ...
      Conference object
    • Faster enumeration of minimal connected dominating sets in split graphs 

      Skjørten, Ida Bredal (The University of Bergen, 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 ...
      Master thesis