$k$-Sum Decomposition of Strongly Unimodular Matrices
Combinatorics
2015-11-17 v2
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 -sums for implying a decomposition into highly connected network-representing blocks, which are also shown to have a special structure.
Keywords
Cite
@article{arxiv.1103.4258,
title = {$k$-Sum Decomposition of Strongly Unimodular Matrices},
author = {Konstantinos Papalamprou and Leonidas Pitsoulis},
journal= {arXiv preprint arXiv:1103.4258},
year = {2015}
}
Comments
version submitted to Optimization Letters