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

DOI10.1007/S11424-022-1178-5zbMATH Open1504.93025OpenAlexW4306692562MaRDI QIDQ2109288FDOQ2109288

Authors: Naqi Fan, Jiuqiang Liu, Lijun Zhang, Shenggui 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

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

zbMATH Keywords

digraphsemi-tensor product of matricesdirected networkmaximum matchingstructural controllability

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Controllability, matching ratio and graph convergence
• A network flow algorithm to find an elementary I/O matching

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)