A network flow algorithm to find an elementary I/O matching

DOI10.1002/NET.3230180203MaRDI QIDQ3783058zbMATH OpenOpenAlexFDO

Authors Takeo Yamada

Publication date 1988

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230180203

zbMATH Keywords

dynamic systemmatchingnetwork flow algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Linear systems in control theory (93C05)

Recommendations

• A graph-theoretic approach to input-output decoupling and linearization
• A sufficient condition for structural decouplability of linear nonsquare systems
• Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices
• Disturbance Decoupling with Pole Placement for Structured Systems: A Graph-Theoretic Approach
• scientific article; zbMATH DE number 274815

Cited in

(4)

• Generic properties and control of linear structured systems: A survey
• A graph-oriented approach to address generically flat outputs in structured LTI discrete-time systems
• A dynamic graph characterisation of the fixed part of the controllable subspace of a linear structured system
• Characterization of generic properties of linear structured systems for efficient computations.

This page was built for publication: A network flow algorithm to find an elementary I/O matching

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