A sufficient condition for a matrix to be totally unimodular
From MaRDI portal
Publication:4121911
DOI10.1002/net.3230030406zbMath0352.05012OpenAlexW2056843540MaRDI QIDQ4121911
Publication date: 1973
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230030406
Related Items (12)
Decomposition of wheel-and-parachute-free balanced bipartite graphs ⋮ On unimodular graphs ⋮ An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs ⋮ Complement total unimodularity ⋮ On unimodular graphs with a unique perfect matching ⋮ Structural properties and recognition of restricted and strongly unimodular matrices ⋮ A decomposition theory for matroids. VII: Analysis of minimal violation matrices ⋮ Restricted unimodular chordal graphs ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications ⋮ Decomposition of balanced matrices ⋮ Block duplicate graphs and a hierarchy of chordal graphs ⋮ A hierarchy of totally unimodular matrices
Cites Work
This page was built for publication: A sufficient condition for a matrix to be totally unimodular
