Efficient target control of complex networks based on preferential matching

Controlling a complex network towards a desired state is of great importance in many applications. Existing works present an approximate algorithm to find the input nodes used to control partial nodes of the network. However, the input nodes obtained by this algorithm depend on the node matching order and cannot achieve optimum results. Here we present a novel algorithm to find the input nodes for target control based on preferential matching. The algorithm elaborately arranges the matching order of the nodes to reduce the size of the input node set. The results on both synthetic and real networks indicate that the proposed algorithm outperforms the previous algorithm.