Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices

DOI10.1007/s11424-022-1178-5zbMath1504.93025OpenAlexW4306692562MaRDI QIDQ2109288

Jiuqiang Liu, Naqi Fan, Sheng Gui Zhang, Li-jun Zhang

Publication date: 20 December 2022

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-022-1178-5

zbMATH Keywords

digraphmaximum matchingdirected networksemi-tensor product of matricesstructural controllability

Mathematics Subject Classification ID

Controllability (93B05) Vector and tensor algebra, theory of invariants (15A72) Networked control (93B70)

Cites Work

• Unnamed Item
• Unnamed Item
• On potential equations of finite games
• The computation of Nash equilibrium in fashion games via semi-tensor product method
• A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
• Data exchange: on the complexity of answering queries with inequalities
• Minimum structural controllability problems of complex networks
• Image encryption algorithm for synchronously updating Boolean networks based on matrix semi-tensor product theory
• Block-based minimum input design for the structural controllability of complex networks
• Semitensor product approach to controllability, reachability, and stabilizability of probabilistic finite automata
• A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
• Stability and Stabilization of Boolean Networks with Stochastic Delays
• Structural controllability
• Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling
• Maximum matching and a polyhedron with 0,1-vertices