Unique solvability and order of complexity of linear networks containing memorylessn-ports

DOI10.1002/cta.4490070105zbMath0395.94035OpenAlexW2011322504MaRDI QIDQ4178929

András Recski

Publication date: 1979

Published in: International Journal of Circuit Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cta.4490070105

zbMATH Keywords

Unique SolvabilityElectric NetworksLinear NetworksMatroid Partition AlgorithmsMemoryless N-PortsOrder of Complexity

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) Applications of graph theory to circuits and networks (94C15)

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, On the sum of matroids. III, Extension of the normal tree method, A network theory approach to the rigidity of skeletal structures. I: Modelling and interconnection

Cites Work

• Network flow, transportation and scheduling. Theory and algorithms
• Unnamed Item