Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"distance dominating set"”.

  1. On Two Combinatorial Optimization Problems in Graphs: Grid Domination and Robustness

    … two problems in combinatorial optimization, the dominating set problem and the robustness problem. In the first half of the thesis, we focus on the dominating set problem in grid graphs and present a distributed algorithm for finding near optimal dominating sets on grids. The dominating set …

    waterloo Repository record for On Two Combinatorial Optimization Problems in Graphs: Grid Domination and Robustness (opens in a new tab)

  2. A New Optimality Measure for Distance Dominating Sets

    … 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 of vertices in <em>G</em> at distance <em>i</em> or less, and a subset of vertices in a graph <em>G</em> is a dominating set if …

    waterloo Repository record for A New Optimality Measure for Distance Dominating Sets (opens in a new tab)