Pages that link to "Item:Q2979368"
From MaRDI portal
The following pages link to Graph Distances and Controllability of Networks (Q2979368):
Displaying 9 items.
- Strong structural controllability of networks: comparison of bounds using distances and zero forcing (Q2097717) (← links)
- Edge controllability of signed networks (Q2103670) (← links)
- A separation theorem for joint sensor and actuator scheduling with guaranteed performance bounds (Q2207184) (← links)
- Characterizing controllable subspace and herdability of signed weighted networks via graph partition (Q2307587) (← links)
- Almost equitable partitions and controllability of leader-follower multi-agent systems (Q2665380) (← links)
- On the herdability of linear time-invariant systems with special topological structures (Q2683228) (← links)
- Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey (Q6073106) (← links)
- Controllability of networked systems with heterogeneous dynamics (Q6097902) (← links)
- Controllability of networked multiagent systems based on linearized Turing's model (Q6491079) (← links)
