Matrices and matroids for systems analysis
A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. Interplay between matrix theory and matroid theory is the main theme of this well written book. Since the original edition appeared in 2000 [see Zbl 0948.05001], steady progress has been made in the theory and application of mixed matrices, a tool for systems analysis. The bibliography contains 360 titles; seven of these titles are dated post 2005. The material is organized in seven chapters: {\parindent=6mm \begin{itemize}\item[1.] Introduction to Structural Approach -- Overview of the Book \item[2.] Matrix, Graph, and Matroid \item[3.] Physical Observations for Mixed Matrix Formulation \item[4.] Theory and Application of Mixed Matrices \item[5.] Polynomial Matrix and Valuated Matroid \item[6.] Theory and Application of Mixed Polynomial Matrices \item[7.] Further Topics \end{itemize}}
- Matrices and matroids for systems analysis
- scientific article; zbMATH DE number 4179390
- Systems analysis by graphs and matroids. Structural solvability and controllability
- Matroidizing set systems
- scientific article; zbMATH DE number 3858856
- scientific article; zbMATH DE number 4066909
- scientific article; zbMATH DE number 5037218
- scientific article; zbMATH DE number 5610905
- scientific article; zbMATH DE number 49099
- scientific article; zbMATH DE number 4068894
- Systems analysis by graphs and matroids. Structural solvability and controllability
- Shortest bibranchings and valuated matroid intersection
- Computing valuations of the Dieudonné determinants
- Global structure identifiability and reconstructibility of an NDS with descriptor subsystems
- A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
- 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)
- scientific article; zbMATH DE number 4179390 (Why is no real title available?)
- Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—
- Computing weighted strength and applications to partitioning
- Tropical ideals
- scientific article; zbMATH DE number 891166 (Why is no real title available?)
- Popular matchings with ties and matroid constraints
- scientific article; zbMATH DE number 5037218 (Why is no real title available?)
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- Matrices and matroids for systems analysis
- CONTROLLABILITY ANALYSIS OF COMPLEX NETWORKS USING STATISTICAL RANDOM SAMPLING
- Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond
- Computing valuations of the Dieudonné determinants
- Orthogonal matroids over tracts
- The complexity of pre-assignment problem for unique minimum vertex cover on bipartite graphs
- Basis sequence reconfiguration in the union of matroids
- Parameterized complexity of submodular minimization under uncertainty
- Deterministic (2/3-)-approximation of matroid intersection using nearly-linear independence-oracle queries
- A general framework for finding diverse solutions via network flow and its applications
This page was built for publication: Matrices and matroids for systems analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902170)