Now showing items 1-2 of 2

    • A New Optimality Measure for Distance Dominating Sets 

      Simjour, Narges (University of Waterloo, 2006)
        We study the problem of finding the smallest power of an input graph that has <em>k</em> disjoint dominating sets, where the <em>i</em>th power of an input graph <em>G</em> is constructed by adding edges between pairs ...
    • Parameterized Enumeration of Neighbour Strings and Kemeny Aggregations 

      Simjour, Narges (University of Waterloo, 2013-08-30)
      In this thesis, we consider approaches to enumeration problems in the parameterized complexity setting. We obtain competitive parameterized algorithms to enumerate all, as well as several of, the solutions for two related ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages