The structural output controllability of a dynamical system is studied. It is known that the maximum size of linking in an associated dynamic graph provides a good upper bound on the dynamic graph and it was believed that the bound is exact. This conjecture is disproved, and a new, efficiently computed lower bound is presented.>
No takes yet. Share an insight, caveat, or question.
Murota et al. (1990) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: