Abstract
This chapter lays the mathematical foundation for combinatorial methods of systems analysis. Combinatorial properties of numerical matrices can be stated and analyzed with the aid of matroid theory, whereas those of polynomial matrices are formulated in the language of valuated matroids in Chap. 5. Emphasis is laid also on the general decomposition principle based on submodularity, and accordingly the Dulmage–Mendelsohn decomposition, which serves as a fundamental tool for the generic-case analysis of matrices, is presented in a systematic manner.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Murota, K. (2010). Matrix, Graph, and Matroid. In: Matrices and Matroids for Systems Analysis. Algorithms and Combinatorics, vol 20. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03994-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-03994-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03993-5
Online ISBN: 978-3-642-03994-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)