{"paper":{"title":"A linear time algorithm to verify strong structural controllability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Alexander Weber, Ferdinand Svaricek, Gunther Reissig","submitted_at":"2014-12-21T14:52:36Z","abstract_excerpt":"We prove that strong structural controllability of a pair of structural matrices $(\\mathcal{A},\\mathcal{B})$ can be verified in time linear in $n + r + \\nu$, where $\\mathcal{A}$ is square, $n$ and $r$ denote the number of columns of $\\mathcal{A}$ and $\\mathcal{B}$, respectively, and $\\nu$ is the number of non-zero entries in $(\\mathcal{A},\\mathcal{B})$. We also present an algorithm realizing this bound, which depends on a recent, high-level method to verify strong structural controllability and uses sparse matrix data structures. Linear time complexity is actually achieved by separately storin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6792","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}