Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/35535
Title: Spanning Cacti for Structurally Controllable Networks
Authors: NGO THI TU ANH
Keywords: Cactus,Spanning Cacti, Lin Theorem, Minimum Input Theorem, Maximum Matching,
Issue Date: 14-Aug-2012
Source: NGO THI TU ANH (2012-08-14). Spanning Cacti for Structurally Controllable Networks. ScholarBank@NUS Repository.
Abstract: In this thesis, we discuss the controllability and structural controllability of directed networks. We introduce the problem of minimum spanning cacti for structurally controllable networks, as well as propose an algorithm to find it. We also conduct experiments applying our algorithm on several computer generated and real networks. The algorithm is an analytical tool for studying the network controllability of real system
URI: http://scholarbank.nus.edu.sg/handle/10635/35535
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
NgoTTA.pdf1.07 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

226
checked on Dec 18, 2017

Download(s)

349
checked on Dec 18, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.