Matrices and matroids for systems analysis
From MaRDI portal
Publication:5917962
zbMATH Open0948.05001MaRDI QIDQ5917962FDOQ5917962
Publication date: 19 January 2000
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Combinatorics in computer science (68R05) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35) Canonical forms, reductions, classification (15A21)
Cited In (89)
- Presentations of transversal valuated matroids
- Extension of M-convexity and L-convexity to polyhedral convex functions
- Expressiveness of matchgates.
- Legendre duality in combinatorial study of matrix pencils
- Deterministic Truncation of Linear Matroids
- Algebraic algorithms for linear matroid parity problems
- Recent Developments in Discrete Convex Analysis
- On the NP-completeness of the perfect matching free subgraph problem
- Uniform modular lattices and affine buildings
- On blockwise symmetric signatures for matchgates
- Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation
- Structural identifiability in low-rank matrix factorization
- Regularization of DAEs based on the signature method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing DM-decomposition of a partitioned matrix with rank-1 blocks
- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
- Computing Walrasian equilibria: fast algorithms and structural properties
- Singular, nonsingular, and bounded rank completions of ACI-matrices
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
- A compact representation for minimizers of \(k\)-submodular functions
- Gross substitutability: an algorithmic survey
- Matrices and matroids for systems analysis
- The linear delta-matroid parity problem
- New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
- Application of M-convex submodular flow problem to mathematical economics
- Generic properties and control of linear structured systems: A survey
- Conjugacy relationship between M-convex and L-convex functions in continuous variables
- On the theory of matchgate computations
- Structural control of single-input rank one bilinear systems
- A Weighted Linear Matroid Parity Algorithm
- Structural analysis for the sensor location problem in fault detection and isolation
- Coordinatewise domain scaling algorithm for M-convex function minimization
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings
- Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation
- Induction of M-convex functions by linking systems
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices
- Holographic algorithms: from art to science
- Discrete convexity in joint winner property
- Non-commutative Edmonds' problem and matrix semi-invariants
- Approximating clique-width and branch-width
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
- Title not available (Why is that?)
- On symmetric signatures in holographic algorithms
- Sensor placement for fault isolation in linear differential-algebraic systems
- Generalized Wong sequences and their applications to Edmonds' problems
- Combinatorial auctions with decreasing marginal utilities
- Rank-width and vertex-minors
- Valuated matroid-based algorithm for submodular welfare problem
- A framework of discrete DC programming by discrete convex analysis
- Structural Identifiability in Low-Rank Matrix Factorization
- Theory of Principal Partitions Revisited
- Disclosing Barriers: A Generalization of the Canonical Partition Based on Lovász’s Formulation
- Title not available (Why is that?)
- A `non-additive' characterization of \(\wp\)-adic norms.
- A combinatorial formula for principal minors of a matrix with tree-metric exponents and its applications
- Existence and uniqueness of the Kronecker covariance MLE
- Exact and approximation algorithms for weighted matroid intersection
- Multiple Exchange Property for M♮-Concave Functions and Valuated Matroids
- The affine representation theorem for abstract convex geometries
- The generic canonical form of a regular structured matrix pencil
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors
- Designing matching mechanisms under constraints: an approach from discrete convex analysis
- On circuit valuation of matroids
- Some conditional probabilities in the TASEP with second class particles
- Index reduction for differential-algebraic equations by substitution method
- Scattered Classes of Graphs
- Linear functional equations with a catalytic variable and area limit laws for lattice paths and polygons
- Rank connectivity and pivot-minors of graphs
- Strong structural input and state observability of linear time-invariant systems: graphical conditions and algorithms
- Sensor fault detection and isolation via networked estimation: rank-deficient dynamical systems
- A compact representation for modular semilattices and its applications
- Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces
- Making Bipartite Graphs DM-Irreducible
- Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection.
- Integral with Respect to a Non Additive Measure: An Overview
- A cost-scaling algorithm for computing the degree of determinants
- Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function
- On a weighted linear matroid intersection algorithm by deg-det computation
- On basic operations related to network induction of discrete convex functions
- Index Reduction via Unimodular Transformations
- Generic pole assignability, structurally constrained controllers and unimodular completion
- On the Kronecker Canonical Form of Singular Mixed Matrix Pencils
- Algebraic algorithms for fractional linear matroid parity via noncommutative rank
- A survey of fundamental operations on discrete convex functions of various kinds
- Representability of orthogonal matroids over partial fields
- A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with \(2 \times 2\) submatrices
- Uniform semimodular lattices and valuated matroids
- A Tractable Class of Binary VCSPs via M-Convex Intersection
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 Q5917962)
