Unique solvability and order of complexity of linear networks containing memorylessn-ports (Q4178929): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5656684 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Network flow, transportation and scheduling. Theory and algorithms / rank | |||
Normal rank | |||
Latest revision as of 01:05, 13 June 2024
scientific article; zbMATH DE number 3614672
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unique solvability and order of complexity of linear networks containing memorylessn-ports |
scientific article; zbMATH DE number 3614672 |
Statements
Unique solvability and order of complexity of linear networks containing memorylessn-ports (English)
0 references
1979
0 references
Matroid Partition Algorithms
0 references
Electric Networks
0 references
Unique Solvability
0 references
Memoryless N-Ports
0 references
Order of Complexity
0 references
Linear Networks
0 references
