Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors
From MaRDI portal
Publication:521811
DOI10.1007/s00453-015-0109-4zbMath1360.90228OpenAlexW2229245939MaRDI QIDQ521811
Publication date: 12 April 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-0109-4
Related Items (2)
Index Reduction via Unimodular Transformations ⋮ 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
Cites Work
- Unnamed Item
- Valuated matroids
- Computing the maximum degree of minors in matrix pencils via combinatorial relaxation
- Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form
- Finding optimal minors of valuated bimatroids
- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices
- Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation
- Structure at inifinity of linear multivariable systems: A geometric approach
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Computing the Degree of Determinants via Combinatorial Relaxation
- Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants
- On some techniques useful for solution of transportation network problems
- Matrices and matroids for systems analysis
This page was built for publication: Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors
