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

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 discre...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica 2017-03, Vol.77 (3), p.815-835
1. Verfasser:	Sato, Shun
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Combinatorial analysis Computer Science Computer Systems Organization and Communication Networks Concavity Data Structures and Information Theory Mathematics of Computing Rational functions Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0178-4617 1432-0541
DOI:	10.1007/s00453-015-0109-4