Greedy algorithm enhances control energy efficiency in complex networks, suggesting significant improvements over random techniques.
The study of control energy needed for controlling target nodes is essential for efficient operation of network systems. In order to further reduce the required control energy, we propose the greedy algorithm based on target path (GATP) to optimize network topology by adding only a few edges. By shortening the distance of between target nodes and driver nodes, the proposed GATP significantly reduces the energy required to control the target nodes in complex networks. The simulation results on Erd˝os–R´enyi, scale-free, and real-world networks demonstrate that target paths play a crucial role in optimizing control energy for controlling target nodes, and that GATP outperforms random allocation, genetic algorithms, and simulated annealing.
No takes yet. Share an insight, caveat, or question.
Song et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: