Exact controllability of complex networks

Versione 1.0.0.0 (1,22 MB) da Tapan
Implements maximum multiplicity algorithm to identify a set of driver nodes
0.0
(0)
742 download
Aggiornato 28 gen 2015

Visualizza la licenza

Please see demo.m for examples on use.
The ExactControllability.m function implements a maximum geometric multiplicity algorithm to identify the number and set of driver nodes in complex network (see included references). Input is an adjacency matrix - directed or undirected.
Please refer to ExactControllability.m for instructions on how to cite.

Cita come

Tapan (2026). Exact controllability of complex networks (https://it.mathworks.com/matlabcentral/fileexchange/49357-exact-controllability-of-complex-networks), MATLAB Central File Exchange. Recuperato .

Compatibilità della release di MATLAB
Creato con R2013b
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Tag Aggiungi tag
Riconoscimenti

Ispirato da: Scale free network using B-A algorithm

Apri in una nuova scheda
Versione Pubblicato Note della release
1.0.0.0