Strong unimodularity for matrices and hypergraphs
From MaRDI portal
DOI10.1016/0166-218X(86)90044-2zbMATH Open0647.05042MaRDI QIDQ1104339FDOQ1104339
Authors: Peter L. Hammer, Toshihide Ibaraki, Yves Crama 
Publication date: 1986
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- Structural properties and recognition of restricted and strongly unimodular matrices
- Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices
- A decomposition of strongly unimodular matrices into incidence matrices of digraphs
- A hierarchy of totally unimodular matrices
- On a Class of Totally Unimodular Matrices
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Hypergraphs (05C65)
Cites Work
- Decomposition of regular matroids
- On the notion of balance of a signed graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Balanced matrices
- A Selection Problem of Shared Fixed Costs and Network Flows
- Hypergraphs with no special cycles
- Unimodular functions
- Title not available (Why is that?)
Cited In (14)
- A hierarchy of totally unimodular matrices
- On the representability of totally unimodular matrices on bidirected graphs
- A decomposition of strongly unimodular matrices into incidence matrices of digraphs
- A necessary and sufficient condition for the total unimodularity of a matrix in terms of graph theory
- Pseudo-Boolean optimization
- Totally unimodular Leontief directed hypergraphs
- Balanced matrices
- Title not available (Why is that?)
- Structural properties and recognition of restricted and strongly unimodular matrices
- Optimisation and hypergraph theory
- A weighted min-max relation for intervals
- Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices
- Permuting matrices to avoid forbidden submatrices
- \(k\)-sum decomposition of strongly unimodular matrices
This page was built for publication: Strong unimodularity for matrices and hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104339)
