Matrices and matroids for systems analysis
From MaRDI portal
Publication:5902170
DOI10.1007/978-3-642-03994-2zbMath1181.05001OpenAlexW1533712308MaRDI 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
matroidspolynomial matrixvaluated matroidsystems analysiscombinatorial relaxation algorithmmixed matricesmixed skew-symmetric matrices
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorics in computer science (68R05) Combinatorial aspects of matroids and geometric lattices (05B35) Canonical forms, reductions, classification (15A21)
Related Items (17)
Global structure identifiability and reconstructibility of an NDS with descriptor subsystems ⋮ Computing Weighted Strength and Applications to Partitioning ⋮ A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds ⋮ Decomposition theorems for square-free 2-matchings in bipartite graphs ⋮ Shortest bibranchings and valuated matroid intersection ⋮ Popular Matchings with Ties and Matroid Constraints ⋮ The \(b\)-branching problem in digraphs ⋮ CONTROLLABILITY ANALYSIS OF COMPLEX NETWORKS USING STATISTICAL RANDOM SAMPLING ⋮ Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs ⋮ Tropical ideals ⋮ Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond ⋮ Computing valuations of the Dieudonné determinants ⋮ Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs ⋮ A module-theoretic approach to matroids ⋮ A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract) ⋮ Computing valuations of the Dieudonné determinants ⋮ Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
This page was built for publication: Matrices and matroids for systems analysis
