Spanning Cacti for Structurally Controllable Networks

Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/35535

DC Field	Value
dc.title	Spanning Cacti for Structurally Controllable Networks
dc.contributor.author	NGO THI TU ANH
dc.date.accessioned	2012-11-30T18:01:09Z
dc.date.available	2012-11-30T18:01:09Z
dc.date.issued	2012-08-14
dc.identifier.citation	NGO THI TU ANH (2012-08-14). Spanning Cacti for Structurally Controllable Networks. ScholarBank@NUS Repository.
dc.identifier.uri	http://scholarbank.nus.edu.sg/handle/10635/35535
dc.description.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
dc.language.iso	en
dc.subject	Cactus,Spanning Cacti, Lin Theorem, Minimum Input Theorem, Maximum Matching,
dc.type	Thesis
dc.contributor.department	MATHEMATICS
dc.contributor.supervisor	ZHANG LOUXIN
dc.description.degree	Master's
dc.description.degreeconferred	MASTER OF SCIENCE
dc.identifier.isiut	NOT_IN_WOS
Appears in Collections:	Master's Theses (Open)

File	Description	Size	Format	Access Settings	Version
NgoTTA.pdf		1.07 MB	Adobe PDF	OPEN	None	View/Download

Check