Dominating communities for hierarchical control of complex networks

DOI10.1016/J.INS.2017.05.052MaRDI QIDQ778406zbMATH OpenOpenAlexFDO

Authors Peng Gang Sun, Xiaoke Ma

Publication date 2 July 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2017.05.052

zbMATH Keywords

hierarchical controlstructure-driven minimum dominating set

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hierarchical systems (93A13)

Recommendations

• Dominating complex networks by identifying minimum skeletons
• scientific article; zbMATH DE number 7156464
• Pinning controllability of complex networks with community structure
• Minimum structural controllability problems of complex networks
• Minimum-cost control of complex networks

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3718924 (Why is no real title available?)
• scientific article; zbMATH DE number 53595 (Why is no real title available?)
• Adequate is better: particle swarm optimization with limited-information
• An Automatic Method of Solving Discrete Programming Problems
• Analysis of critical and redundant nodes in controlling directed and undirected complex networks using dominating sets
• Anti-modularity and anti-community detecting in complex networks
• Co-controllability of drug-disease-gene network
• Community structure in social and biological networks
• Control Profiles of Complex Networks
• Controllability and modularity of complex networks
• Exploring complex networks
• Flow of Control in Networks
• Identification of overlapping and non-overlapping community structure by fuzzy clustering in complex networks
• Mathematical Description of Linear Dynamical Systems
• Opinion control in complex networks
• Statistical mechanics of complex networks

Cited in

(8)

• Understanding control of network spreading from network controllability
• Structure properties of collaboration network with tunable clustering
• Exact and heuristic algorithms for the weighted total domination problem
• An iterated greedy algorithm for finding the minimum dominating set in graphs
• Identifying vital nodes in complex networks based on information entropy, minimum dominating set and distance
• The weighted independent domination problem: integer linear programming models and metaheuristic approaches
• Dominating complex networks by identifying minimum skeletons
• Prediction and prevention of disproportionally dominant agents in complex networks

Describes a project that uses

Uses Software

• GraphBase

This page was built for publication: Dominating communities for hierarchical control of complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778406)