Controllability and algorithms of complex networks
From MaRDI portal
Publication:2993336
Recommendations
- scientific article; zbMATH DE number 7156464
- Controllability emerging from conditional path reachability in complex networks
- Minimum structural controllability problems of complex networks
- Algorithm for identifying minimum driver nodes based on structural controllability
- Minimum-cost control of complex networks
Cited in
(55)- Structural controllability and time-to-control of directed scale-free networks with minimum number of driver nodes
- Constrained target controllability of complex networks
- A new focus in the science of networks: towards methods for design
- Fixed parameter algorithms and hardness of approximation results for the structural target controllability problem
- The minimum rank completion problems for tri-diagonal partial full sign patterns
- Optimization, Learning, and Control for Interdependent Complex Networks
- Controlling temporal networks
- Minimal structural perturbations for controllability of a networked system: complexities and approximations
- Controllability in directed complex networks: granular computing perspective
- Understanding control of network spreading from network controllability
- Influence control method on directed weighted signed graphs with deterministic causality
- On the control of psychological networks
- Fixed parameter algorithms and hardness of approximation results for the structural target controllability problem
- On almost controllability of dynamical complex networks with noises
- scientific article; zbMATH DE number 7156464 (Why is no real title available?)
- Quantitative controllability index of complex networks
- Analysis of critical and redundant nodes in controlling directed and undirected complex networks using dominating sets
- Design and topological analysis of complex networks with optimal controllability
- Large-scale system control and complex networks -- exploration and thinking
- Strongly Uncontrollable Network Topologies
- The impact of graph symmetry on the number of driver nodes in complex networks
- On the minimum driver node set of \(k\)-uniform linear hypertree networks
- Linear processes on complex networks
- Controllability of the better chosen partial networks
- On quantitatively measuring controllability of complex networks
- Minimum structural controllability problems of complex networks
- Optimizing the controllability of arbitrary networks with genetic algorithm
- Role extraction in complex networks and its application in control of networks
- Characterizing the topological and controllability features of U.S. power transmission networks
- Spectral coarse grained controllability of complex networks
- Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices
- Controllability and modularity of complex networks
- Exact controllability of multiplex networks
- Target control and expandable target control of complex networks
- Toward optimizing control signal paths in functional brain networks
- Control‐channel interactions in diffusive dynamical networks: A graph‐theoretic perspective
- Controllable subspace of edge dynamics in complex networks
- Identifying and using driver nodes in temporal networks
- Optimal control of complex networks with conformity behavior
- Minimum-cost control of complex networks
- Enhancing complex network controllability by minimum link direction reversal
- Controllability of weighted and directed networks with nonidentical node dynamics
- Controllability emerging from conditional path reachability in complex networks
- Domain control of nonlinear networked systems and applications to complex disease networks
- Key-nodes selection problem for minimum cost control of directed networks
- Controllability of supply chain network and it's minimum control input
- Optimization of stochastic discrete systems and control on complex networks. Computational networks
- Maximum entropy networks are more controllable than preferential attachment networks
- Algorithm for identifying minimum driver nodes based on structural controllability
- Control mechanisms in network structures
- Studies on controllability of directed networks with extremal optimization
- Structural controllability analysis of high order non-Markov temporal networks
- Key node selection in minimum-cost control of complex networks
- An efficient algorithm for determining the connectivity of complex undirected networks
- Research progress in enhancing the controllability of complex networks
This page was built for publication: Controllability and algorithms of complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2993336)
