Key node selection in minimum-cost control of complex networks
From MaRDI portal
Publication:2146809
DOI10.1016/J.PHYSA.2017.05.090zbMATH Open1499.93007OpenAlexW2620739531MaRDI QIDQ2146809FDOQ2146809
Authors: Jie Ding, Changyun Wen, Guoqi Li 
Publication date: 21 June 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2017.05.090
Recommendations
- Key-nodes selection problem for minimum cost control of directed networks
- Minimum-cost control of complex networks
- Towards the minimum-cost control of target nodes in directed networks with linear dynamics
- scientific article; zbMATH DE number 7156464
- Controllability and algorithms of complex networks
Deterministic network models in operations research (90B10) Controllability (93B05) Decentralized systems (93A14) Networked control (93B70)
Cites Work
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Title not available (Why is that?)
- The Structure and Function of Complex Networks
- Title not available (Why is that?)
- Exploring complex networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- The robust minimal controllability problem
- Minimum cost input/output design for large-scale linear structural systems
- Control Profiles of Complex Networks
- Scale-Free Networks
- Structural controllability
- Controllability Metrics, Limitations and Algorithms for Complex Networks
- Minimal Controllability Problems
- Cooperative Optimal Control for Multi-Agent Systems on Directed Graph Topologies
- On Submodularity and Controllability in Complex Dynamical Networks
- Analysis and optimization of certain qualities of controllability and observability for linear dynamical systems
- Minimum-cost control of complex networks
Cited In (5)
This page was built for publication: Key node selection in minimum-cost control of complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146809)
