<--- Back to Details
First PageDocument Content
Control theory / Graph theory / NP-complete problems / Controllability / Dominating set / Vertex / Graph / Network theory / Network controllability / Mathematics / Theoretical computer science / Applied mathematics
Date: 2013-09-21 17:44:33
Control theory
Graph theory
NP-complete problems
Controllability
Dominating set
Vertex
Graph
Network theory
Network controllability
Mathematics
Theoretical computer science
Applied mathematics

Introduction Power Domination Network and Attack Models Structural Controllability under Vertex Removal Conclusions and Future Work

Add to Reading List

Source URL: www.critis2013.nl

Download Document from Source Website

File Size: 293,40 KB

Share Document on Facebook

Similar Documents

Edsger W. Dijkstra / Network theory / Shortest path problem / Constructible universe / Total least squares

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

DocID: 1xVkB - View Document

PDF Document

DocID: 1xkJU - View Document

Graph theory Po-Shen Loh June

DocID: 1vmTo - View Document

Graph theory Po-Shen Loh June

DocID: 1vhpu - View Document

Graph theory Po-Shen Loh June

DocID: 1v8nl - View Document