Identifying and using driver nodes in temporal networks

DOI10.1093/COMNET/CNZ004zbMATH Open1473.90041OpenAlexW2921677284MaRDI QIDQ4958784FDOQ4958784

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

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

zbMATH Keywords

heuristiccontrollabilitycomplex networkstemporal networksdriver nodes

Mathematics Subject Classification ID

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

Cited In (3)

• Detecting the driver nodes of temporal networks
• Algorithm for identifying minimum driver nodes based on structural controllability
• 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)