Controllability in Directed Complex Networks: Granular Computing Perspective

DOI10.1007/978-3-319-25783-9_15zbMath1444.93012OpenAlexW2403689315MaRDI QIDQ3300265

Zehua Chen, Yunyun Yang, Gang Xie

Publication date: 28 July 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-25783-9_15

zbMATH Keywords

maximum matchingdriver nodecontrolling complex networksgranular computing (GrC)unmatched nodes

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Controllability (93B05) Reasoning under uncertainty in the context of artificial intelligence (68T37) Networked control (93B70)

Cites Work

• Unnamed Item
• On pinning synchronization of complex dynamical networks
• Model predictive control: Theory and practice - a survey
• Complex networks: structure and dynamics
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Assignment Problems
• The Structure and Function of Complex Networks
• Pinning a Complex Dynamical Network to Its Equilibrium
• Exploring complex networks
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs