Matrices and matroids for systems analysis
From MaRDI portal
Publication:5902170
DOI10.1007/978-3-642-03994-2zbMath1181.05001MaRDI QIDQ5902170
Publication date: 29 October 2009
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03994-2
matroids; polynomial matrix; valuated matroid; systems analysis; combinatorial relaxation algorithm; mixed matrices; mixed skew-symmetric matrices
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
68R05: Combinatorics in computer science
05B35: Combinatorial aspects of matroids and geometric lattices
15A21: Canonical forms, reductions, classification
Related Items
Computing Weighted Strength and Applications to Partitioning, Tropical ideals, Popular Matchings with Ties and Matroid Constraints, Shortest bibranchings and valuated matroid intersection, The \(b\)-branching problem in digraphs, Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs, A module-theoretic approach to matroids, Decomposition theorems for square-free 2-matchings in bipartite graphs, Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs, A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract)