Key-nodes selection problem for minimum cost control of directed networks
The key-nodes selection problem is to determine key nodes from all those connected to external control sources so that the minimum cost is achieved when they are used to control a directed network. Clearly, it is an important issue in both theory and application. But its solution still remains open...
Saved in:
Main Authors: | Li, Guoqi, Tang, Pei, Wen, Changyun, Huang, Jiangshuai, Ma, Cheng |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/141698 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Four-node relay network with Bi-directional traffic employing wireless network coding with pre-cancellation
by: Su, K.K., et al.
Published: (2016) -
Controlling directed networks with evolving topologies
by: Li, Guoqi, et al.
Published: (2021) -
Probabilistic Key Predistribution in Mobile Networks Resilient to Node-Capture Attacks
by: Zhao, Jun
Published: (2017) -
Interdependency and vulnerability of multipartite networks under target node attacks
by: Cai, Qing, et al.
Published: (2020) -
Allocating minimum number of leaders for seeking consensus over directed networks with time-varying nonlinear multi-agents
by: Gao, Leitao, et al.
Published: (2021)