Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices
From MaRDI portal
Publication:2109288
Recommendations
- Controllability and algorithms of complex networks
- Algorithm for identifying minimum driver nodes based on structural controllability
- Minimum structural controllability problems of complex networks
- Structural controllability and time-to-control of directed scale-free networks with minimum number of driver nodes
- scientific article; zbMATH DE number 7156464
Cites work
- A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
- A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
- An introduction to semi-tensor product of matrices and its applications
- Block-based minimum input design for the structural controllability of complex networks
- Data exchange: on the complexity of answering queries with inequalities
- Graph theory
- Image encryption algorithm for synchronously updating Boolean networks based on matrix semi-tensor product theory
- Maximum matching and a polyhedron with 0,1-vertices
- Minimum structural controllability problems of complex networks
- On potential equations of finite games
- Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling
- Semitensor product approach to controllability, reachability, and stabilizability of probabilistic finite automata
- Stability and Stabilization of Boolean Networks with Stochastic Delays
- Structural controllability
- The computation of Nash equilibrium in fashion games via semi-tensor product method
Cited in
(2)
This page was built for publication: Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109288)
