The following pages link to (Q5210053):
Displaying 14 items.
- Dominating communities for hierarchical control of complex networks (Q778406) (← links)
- Minimum structural controllability problems of complex networks (Q1619005) (← links)
- Optimizing the controllability of arbitrary networks with genetic algorithm (Q1619203) (← links)
- Controllability of the better chosen partial networks (Q1619559) (← links)
- Algorithm for identifying minimum driver nodes based on structural controllability (Q1664935) (← links)
- Studies on controllability of directed networks with extremal optimization (Q1673371) (← links)
- Dominating complex networks by identifying minimum skeletons (Q1694056) (← links)
- Optimizing network topology for average controllability (Q2059509) (← links)
- Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices (Q2109288) (← links)
- Key node selection in minimum-cost control of complex networks (Q2146809) (← links)
- Structural controllability and time-to-control of directed scale-free networks with minimum number of driver nodes (Q2242949) (← links)
- Block-based minimum input design for the structural controllability of complex networks (Q2280810) (← links)
- Design and Topological Analysis of Complex Networks with Optimal Controllability (Q2930507) (← links)
- Controllability emerging from conditional path reachability in complex networks (Q3133884) (← links)
