返回
Finding complete minimum driver node set with guaranteed control capacity
DOI:10.1016/j.neucom.2022.05.095.png)
摘要
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.
Keyword:
Structural controllability
Control capacity
Driver node set
Maximum matching
Complex networks
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Genetic evaluation of Andrographis paniculata (Burm. f.) Nees revealed by SSR, AFLP and RAPD markers
Effect of Bacillus Probiotics on the Immunological Responses of Nile Tilapia (Oreochromis niloticus): A Review
Fishes
IF0
Controllability analysis of the directed human protein interaction network identifies disease genes and drug targets定向人类蛋白质相互作用网络的可控性分析识别疾病基因和药物靶标

