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 6 of 6 for “"Power Dominating Set"”.
-
Novel Integer Optimization Methods and their Applications in Biomass Supply Chain and Power Dominating Set
… in the dissertation is the application of IO to power systems, especially power dominating set problems. The IO has been applied in almost every aspect of the power system industry, including power system network design problem, unit commitment problem, and sensor placement problem. Phasor …
-
Placing Monitoring Devices in Electric Power Networks Modeled by Block Graphs.
The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well known vertex covering and dominating set problems in graph theory. A set S of vertices is defined to be a power dominating set of a graphs if every …
-
On the Power Domination Problem in Graphs
A crucial task for electric power companies consists of the continuous monitoring of their power network. This monitoring can be efficiently accomplished by placing phase measurement units (PMUs) at selected network locations. However, due to the high cost of the PMUs, their number must be …
-
Integer Programming Techniques for Propagation and Rainbow Connection Problems in Graphs
… including the positive semidefinite zero forcing set problem and the minimum power dominating set problem are considered, as well as the graph connectivity problem known as the strong rainbow connection problem. A parallel treatment of the graph propagation problems is provided in which set cover …
-
Monitoring on Graphs: An Exploration into k-Cores, Zero Forcing, and Power Domination
… Further, a heuristic for the hitting set of the minimal l-cores is given with its associated valid inequality. Additionally, improved valid inequalities are generated using bounds generated via the girth of the graph. Multiple low order heuristics are explored for finding initial …
-
Hardness results and approximation algorithms for some problems on graphs
… $G$ and the goal is to find a minimum-sized set of nodes $S$ that covers all of the nodes, where a node $v$ is covered if (1) $v$ is in $S$, or (2) $v$ has a neighbor $u$ such that $u$ and all of its neighbors except $v$ are covered. Rule (2) is called the propagation rule, and it is applied …