Combinatorial Relaxation Algorithm for the Entire Sequence of the Maximum Degree of Minors

Abstract

This paper presents an efficient “combinatorial relaxation” algorithm for computing the entire sequence of the maximum degree of minors in rational function matrices, whereas the previous algorithms find them separately for a specified order k. The efficiency of the algorithm is based on the discrete concavity related to valuated bimatroids. 
DOI: 10.1007/s00453-015-0109-4

Topics

4 Figures and Tables

Statistics

020406080201520162017
Citations per Year

Citation Velocity: 7

Averaging 7 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Sato2015CombinatorialRA, title={Combinatorial Relaxation Algorithm for the Entire Sequence of the Maximum Degree of Minors}, author={Shun Sato}, journal={Algorithmica}, year={2015}, volume={77}, pages={815-835} }