k-sum decomposition of strongly unimodular matrices

DOI10.1007/S11590-015-0975-3MaRDI QIDQ526424zbMATH OpenOpenAlexFDO

Authors Konstantinos Papalamprou, Leonidas Pitsoulis

Publication date 12 May 2017

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1103.4258

zbMATH Keywords

complex networksmatroidstotally unimodular matrices

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Abstract: Networks are frequently studied algebraically through matrices. In this work, we show that networks may be studied in a more abstract level using results from the theory of matroids by establishing connections to networks by decomposition results of matroids. First, we present the implications of the decomposition of regular matroids to networks and related classes of matrices, and secondly we show that strongly unimodular matrices are closed under $k$-sums for $k=1,2$ implying a decomposition into highly connected network-representing blocks, which are also shown to have a special structure.

Recommendations

• A decomposition of strongly unimodular matrices into incidence matrices of digraphs
• On the representability of totally unimodular matrices on bidirected graphs
• On the decomposition of vector spaces
• scientific article; zbMATH DE number 4023304
• scientific article; zbMATH DE number 3885921

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 863479 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• scientific article; zbMATH DE number 5047784 (Why is no real title available?)
• A decomposition of strongly unimodular matrices into incidence matrices of digraphs
• A hierarchy of totally unimodular matrices
• Decomposition of regular matroids
• Networks, crowds and markets. Reasoning about a highly connected world.
• Networks. An introduction.
• On the representability of totally unimodular matrices on bidirected graphs
• Social and economic networks.
• Strong unimodularity for matrices and hypergraphs
• Structural properties and recognition of restricted and strongly unimodular matrices

Cited in

(1)

• A decomposition of strongly unimodular matrices into incidence matrices of digraphs

This page was built for publication: \(k\)-sum decomposition of strongly unimodular matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526424)