Sufficient control of complex network
This paper serves to further analyze the performance of the suggested algorithm which uses the minimum cost flow problem to control a sufficiently large portion of the network, where only the quantity of controllable nodes matters. Previously, the algorithm has been simulated on complex networks suc...
Saved in:
主要作者: | |
---|---|
其他作者: | |
格式: | Final Year Project |
語言: | English |
出版: |
Nanyang Technological University
2022
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/158066 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |