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:
Main Author: | |
---|---|
Other Authors: | |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/158066 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Be the first to leave a comment!