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

Yamada Takeo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

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

Author(s) -

Yamada Takeo

Publication year - 1988

Publication title -

networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.977

H-Index - 64

eISSN - 1097-0037

pISSN - 0028-3045

DOI - 10.1002/net.3230180203

Subject(s) - decoupling (probability) , matching (statistics) , algorithm , representation (politics) , graph , flow network , flow (mathematics) , computer science , mathematics , combinatorics , statistics , geometry , control engineering , politics , law , political science , engineering

Linnemann (Decoupling of structured systems. Syst. Contr. Lett. 1 (1981) 79‐86) proved that a linear square ( m ‐input, m ‐output) dynamic system is structurally decouplable via a linear feedback if and only if there exists an elementary i/o matching in the graph representation of that system. This note supplements the above result by presenting an efficient network flow algorithm to find such a matching.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research