Kuo-Hua Kao

Learn More
The power domination problem is to find a minimum placement of phase measurement units (PMUs) for observing the whole electric power system represented by a graph G. The number of such a minimum placement of PMUs is called the power domination number of G and is denoted by p(G). Finding p(G) of an arbitrary graph is known to be NP-complete. In this paper,(More)
  • 1