A network flow algorithm to find an elementary I/O matching
Takeo Yamada · Networks · 1988
Abstract 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.