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

DOI10.1002/CTA.4490070105MaRDI QIDQ4178929zbMATH OpenOpenAlexFDO

Authors 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

Electric NetworksLinear NetworksMatroid Partition AlgorithmsMemoryless N-PortsOrder of ComplexityUnique Solvability

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3387235 (Why is no real title available?)
• Network flow, transportation and scheduling. Theory and algorithms

Cited in

(5)

• Extension of the normal tree method
• Network theory and transversal matroids
• Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations
• A network theory approach to the rigidity of skeletal structures. I: Modelling and interconnection
• On the sum of matroids. III

This page was built for publication: Unique solvability and order of complexity of linear networks containing memorylessn-ports

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178929)