On the NP-hardness of the robust minimal structural controllability problem
From MaRDI portal
Cites work
- A Framework for Structural Input/Output and Control Configuration Selection in Large-Scale Systems
- Actuator Placement Under Structural Controllability Using Forward and Reverse Greedy Algorithms
- An overview of structural systems theory
- Complexity of approximating bounded variants of optimization problems
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- Input addition and leader selection for the controllability of graph-based systems
- Max-min control problems: A system theoretic approach
- Minimal Controllability Problems
- Minimal structural perturbations for controllability of a networked system: complexities and approximations
- Minimum jointly structural input and output selection
- Observability Robustness Under Sensor Failures: A Computational Perspective
- On the computational complexity of the secure state-reconstruction problem
- On the Structural and Strong Structural Controllability of Undirected Networks
- Reducibility among combinatorial problems
- Structural controllability
- Structural controllability of multiinput linear systems
- Structural Controllability of Symmetric Networks
- The robust minimal controllability and observability problem
- The robust minimal controllability problem
This page was built for publication: On the NP-hardness of the robust minimal structural controllability problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7303191)