In this paper we study structural controllability and time-to-control of directed scale-free networks, and propose algorithms to guarantee these properties with the minimum number of driver nodes. Structural controllability is a qualitative (i.e. topological) measure of the ability to steer the network to a desired state from an arbitrary initial state; while time-to-control measures how fast the above steering can be done. First, we develop an algorithm that generates directed scale-free networks which are provably structurally controllable with only one driver node. Moreover, considering the tradeoff between control cost (number of driver nodes) and control performance (time-to-control), we propose another algorithm that constructs directed scale-free networks which can be steered to a desired state within a prescribed time bound and with the minimum number of driver nodes.

在本文中，我们研究了有向无标度网络的结构可控性和时间控制，并提出了以最少数量的驱动节点来保证这些特性的算法。结构可控性是将网络从任意初始状态引导到所需状态的能力的定性（即拓扑）度量；而时间控制衡量上述转向的速度。首先，我们开发了一种生成有向无标度网络的算法，该网络可证明只有一个驱动程序节点在结构上是可控的。此外，考虑到控制成本（驱动节点的数量）和控制性能（控制时间）之间的权衡，