Abstract
The problem of controllability of complex networks is central in network theory and has yield many promising and significant results. In this paper, we focus on the controllability of complex networks with arbitrary topology and weight. Base on node's control capacity, we propose algorithms to identify the minimum driver node set and the approximately minimum controlled node set. Moreover, we simulate our algorithms on real and man-made networks and simulation results show that our algorithms are efficient in identifying the minimum driver node set and approximately minimum controlled node set.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
