Cargando…
An efficient algorithm for finding all possible input nodes for controlling complex networks
Understanding structural controllability of a complex network requires to identify a Minimum Input nodes Set (MIS) of the network. Finding an MIS is known to be equivalent to computing a maximum matching of the network, where the unmatched nodes constitute an MIS. However, maximum matching is often...
Autores principales: | Zhang, Xizhe, Han, Jianfei, Zhang, Weixiong |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5587595/ https://www.ncbi.nlm.nih.gov/pubmed/28878394 http://dx.doi.org/10.1038/s41598-017-10744-w |
Ejemplares similares
-
Input graph: the hidden geometry in controlling complex networks
por: Zhang, Xizhe, et al.
Publicado: (2016) -
Efficient motif finding algorithms for large-alphabet inputs
por: Kuksa, Pavel P, et al.
Publicado: (2010) -
Efficient target control of complex networks based on preferential matching
por: Zhang, Xizhe, et al.
Publicado: (2017) -
Input node placement restricting the longest control chain in controllability of complex networks
por: Alizadeh, Samie, et al.
Publicado: (2023) -
Total network controllability analysis discovers explainable drugs for Covid-19 treatment
por: Wei, Xinru, et al.
Publicado: (2023)