Computing the maximum degree of minors in matrix pencils via combinatorial relaxation
The author presents an algorithm for computing the maximum degree of a minor of order \(k\) in a matrix pencil. The algorithm solves the weighted bipartite matching problem. If the upper bound is not tight then the algorithm performs the matrix modification of an equivalence transformation with constant matrices.
scientific article; zbMATH DE number 1967771