.png){kind=icon}
Return
Finding complete minimum driver node set with guaranteed control capacity
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2022.05.095.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A critical prerequisite for controlling complex networks is to find a driver node set with a structural controllability guarantee. This paper introduces the control capacity for a driver node set and solves the problem of finding a complete minimum driver node set that not only guarantees network structural controllability but achieves the desired level of control capacity. A novel algorithmic framework is proposed which is based on the concept of equivalent set and approximate matching replacement technique. The proposed algorithmic framework is shown to outperform the state-of-the-art approaches in the literature. The validity of the proposed algorithm is analyzed and the performance is evaluated by experiments on artificial and real-world complex networks. (c) 2022 Elsevier B.V. All rights reserved.
Keywords:
Structural controllability
Control capacity
Driver node set
Maximum matching
Complex networks
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
Cited Papers
Genetic evaluation of Andrographis paniculata (Burm. f.) Nees revealed by SSR, AFLP and RAPD markers
PREAI
ShareSaveShareSaveEffect of Bacillus Probiotics on the Immunological Responses of Nile Tilapia (Oreochromis niloticus): A Review.png)
Fishes
OAAI
FishesIF0
OAAIShareSaveShareSave
ShareSaveShareSaveShareSave
View more