On the complexity of recognizing a class of generalized networks
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3791941 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A note on detecting simple redundancies in linear systems
- An efficient PQ-graph algorithm for solving the graph-realization problem
- An efficient scaling procedure for gain networks
- Connectivity in bicircular matroids
- Converting Linear Programs to Network Problems
- Graph theory
- Voltage-graphic matroids
Cited in
(6)
This page was built for publication: On the complexity of recognizing a class of generalized networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1058995)