Investigating solvability and complexity of linear active networks by means of matroids

DOI10.1109/TCS.1979.1084645zbMath0406.94021MaRDI QIDQ4193403

Björn Petersen

Publication date: 1979

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

zbMATH Keywords

Matroid Partition AlgorithmOrder of Complexity of Linear Active Networks

Mathematics Subject Classification ID

Analytic circuit theory (94C05) Combinatorial aspects of matroids and geometric lattices (05B35) Applications of design theory to circuits and networks (94C30)

Related Items

Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations, Network theory and transversal matroids, Extension of the normal tree method, Use of matroid theory in operations research, circuits and systems theory, On a class of linear matrices with degenerate specialization