Generalized Power Domination

Aleš Omerzel (2014) Generalized Power Domination. EngD thesis.

Preview

Abstract

The power domination problem is an optimization problem that has emerged together with the development of the power networks. It is important to control the voltage and current in all the nodes and links in a power network. Measuring devices are expensive, which is why there is a tendency to place a minimum number of devices in a power network so that the network remains fully supervised. The k-power domination is a generalization of the power domination. The thesis represents the rules of the dissemination of the control in the network. A linear algorithm is provided for finding the optimal k-power dominating set on trees and followed by the implementation of the algorithm in Java. At the end NP-completeness for the power domination problem on bipartite graphs is proved.

Item Type:

Thesis (EngD thesis)

Keywords:

power domination, general power domination, tree, Java, NP-complete problem.

Number of Pages:

Language of Content:

Slovenian

Mentor / Comentors:

Name and Surname	ID	Function
prof. dr. Sandi Klavžar		Mentor

Link to COBISS:

http://www.cobiss.si/scripts/cobiss?command=search&base=50070&select=(ID=00010783828)

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

2647

Date Deposited:

09 Sep 2014 10:25

Last Modified:

30 Sep 2014 12:47

URI:

http://eprints.fri.uni-lj.si/id/eprint/2647

Actions (login required)

View Item