Abstract
In recent years, structural controllability of complex network has aroused great interest. In literatures fruitful results have been achieved on finding the minimum number of driver nodes which guarantee the network structurally controllable. Algorithms for selecting a group of such driver nodes are also proposed. However, for practical applications, it is always desirable to have more possibilities for driver nodes selection such that additional requirements caused by network operation or control can be considered. This paper focuses on finding complete schemes of eliminating redundant driver nodes from a given available driver node set without destroying the structural controllability. We solve this problem according to the two algebraic conditions of structural controllability respectively and the effectiveness and efficiency of the algorithm are also discussed based on some related tests.
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.
