Enhancing complex network controllability by minimum link direction reversal
From MaRDI portal
Recommendations
- Research progress in enhancing the controllability of complex networks
- Optimizing controllability of edge dynamics in complex networks by perturbing network structure
- Controllability and algorithms of complex networks
- Controllability emerging from conditional path reachability in complex networks
- Studies on controllability of directed networks with extremal optimization
Cites work
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Control Profiles of Complex Networks
- Emergence of Scaling in Random Networks
- Mathematical Description of Linear Dynamical Systems
- Maximum matching and a polyhedron with 0,1-vertices
- Pinning control of scale-free dynamical networks
- Structural controllability
Cited in
(5)- Controllability in directed complex networks: granular computing perspective
- scientific article; zbMATH DE number 7156464 (Why is no real title available?)
- The impact of graph symmetry on the number of driver nodes in complex networks
- Action selection in growing state spaces: control of network structure growth
- Research progress in enhancing the controllability of complex networks
This page was built for publication: Enhancing complex network controllability by minimum link direction reversal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q315957)
