Strong unimodularity for matrices and hypergraphs

DOI10.1016/0166-218X(86)90044-2zbMath0647.05042MaRDI QIDQ1104339

Peter L. Hammer, Toshihide Ibaraki, Yves Cramer

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

signed hypergraph0-1 matrixstrongly unimodular

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (9)

Permuting matrices to avoid forbidden submatrices ⋮ Balanced matrices ⋮ Structural properties and recognition of restricted and strongly unimodular matrices ⋮ A weighted min-max relation for intervals ⋮ A decomposition of strongly unimodular matrices into incidence matrices of digraphs ⋮ \(k\)-sum decomposition of strongly unimodular matrices ⋮ Pseudo-Boolean optimization ⋮ Optimisation and hypergraph theory ⋮ A hierarchy of totally unimodular matrices

Cites Work

• Hypergraphs with no special cycles
• Unimodular functions
• Decomposition of regular matroids
• On the notion of balance of a signed graph
• A Selection Problem of Shared Fixed Costs and Network Flows
• Balanced matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strong unimodularity for matrices and hypergraphs