A sufficient condition for a matrix to be totally unimodular

DOI10.1002/NET.3230030406zbMATH Open0352.05012OpenAlexW2056843540MaRDI QIDQ4121911FDOQ4121911

Authors: F. Commoner 

Publication date: 1973

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230030406

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Cites Work

• Title not available (Why is that?)
• A Class Of Abelian Groups

Cited In (12)

• A hierarchy of totally unimodular matrices
• On unimodular graphs with a unique perfect matching
• A decomposition theory for matroids. VII: Analysis of minimal violation matrices
• On unimodular graphs
• Decomposition of wheel-and-parachute-free balanced bipartite graphs
• Restricted unimodular chordal graphs
• Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
• Structural properties and recognition of restricted and strongly unimodular matrices
• Decomposition of balanced matrices
• Complement total unimodularity
• Block duplicate graphs and a hierarchy of chordal graphs
• An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs

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)