A sufficient condition for a matrix to be totally unimodular
From MaRDI portal
Publication:4121911
Cites work
Cited in
(12)- Structural properties and recognition of restricted and strongly unimodular matrices
- On unimodular graphs with a unique perfect matching
- Decomposition of wheel-and-parachute-free balanced bipartite graphs
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices
- On unimodular graphs
- Complement total unimodularity
- A hierarchy of totally unimodular matrices
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
- Decomposition of balanced matrices
- An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs
- Block duplicate graphs and a hierarchy of chordal graphs
- Restricted unimodular chordal graphs
This page was built for publication: A sufficient condition for a matrix to be totally unimodular
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4121911)