Identifying and using driver nodes in temporal networks

DOI10.1093/COMNET/CNZ004MaRDI QIDQ4958784zbMATH OpenOpenAlexFDO

Authors Babak Ravandi, Fatma Mili, John A. Springer

Publication date 15 September 2021

Published in Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL https://docs.lib.purdue.edu/cit_articles/11

zbMATH Keywords

complex networkscontrollabilitydriver nodesheuristictemporal networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Structural controllability and time-to-control of directed scale-free networks with minimum number of driver nodes
• Controllability of the better chosen partial networks
• Controlling temporal networks
• Controllability and algorithms of complex networks
• Algorithm for identifying minimum driver nodes based on structural controllability

Cited in

(3)

• Algorithm for identifying minimum driver nodes based on structural controllability
• Detecting the driver nodes of temporal networks
• On controllability of temporal networks

This page was built for publication: Identifying and using driver nodes in temporal networks

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