Unique solvability and order of complexity of linear networks containing memorylessn-ports
- 1 January 1979
- journal article
- research article
- Published by Wiley in International Journal of Circuit Theory and Applications
- Vol. 7 (1) , 31-42
- https://doi.org/10.1002/cta.4490070105
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- The generalized tree for state variables in linear active networksInternational Journal of Circuit Theory and Applications, 1976
- Matroid intersection algorithmsMathematical Programming, 1975
- On the sum of matroidsActa Mathematica Hungarica, 1973
- Matching theory for combinatorial geometriesTransactions of the American Mathematical Society, 1971