Insight into controllability of complex networks through augmenting trail

DOI10.1093/COMNET/CNAG011MaRDI QIDQ7320927zbMATH OpenFDO

Authors Shanmugam Esakkimuthu, Usha Ramanathan, Pandiaraja Duraisamy

Publication date 28 August 2026

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

Full work available at URL https://doi.org/10.1093/COMNET/CNAG011

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A Framework for Structural Input/Output and Control Configuration Selection in Large-Scale Systems
• A Supermodular Optimization Framework for Leader Selection Under Link Noise in Linear Multi-Agent Systems
• Control Profiles of Complex Networks
• Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
• Linear algorithm for optimal path cover problem on interval graphs
• Minimal Input and Output Selection for Stability of Systems With Uncertainties
• Network science. With Márton Pósfai
• Observability of complex systems
• On Path Cover Problems in Digraphs and Applications to Program Testing
• On polynomially solvable constrained input selections for fixed and switched linear structured systems
• Structural controllability
• Submodularity in Input Node Selection for Networked Linear Systems: Efficient Algorithms for Performance and Controllability
• Total unimodularity and strongly polynomial solvability of constrained minimum input selections for structural controllability: an LP-based method

This page was built for publication: Insight into controllability of complex networks through augmenting trail

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