Analysis of critical and redundant nodes in controlling directed and undirected complex networks using dominating sets
From MaRDI portal
Publication:4689347
DOI10.1093/comnet/cnu029zbMath1397.05179OpenAlexW2331416186MaRDI QIDQ4689347
Publication date: 16 October 2018
Published in: Journal of Complex Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comnet/cnu029
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (7)
Hierarchical sequencing of online social graphs ⋮ Almost equitable partitions and controllability of leader-follower multi-agent systems ⋮ CONTROL CONTRIBUTION IDENTIFIES TOP DRIVER NODES IN COMPLEX NETWORKS ⋮ Controllability and observability of cascading failure networks ⋮ Controllability and modularity of complex networks ⋮ Dominating communities for hierarchical control of complex networks ⋮ Strong structural controllability of networks: comparison of bounds using distances and zero forcing
This page was built for publication: Analysis of critical and redundant nodes in controlling directed and undirected complex networks using dominating sets