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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithmica Ročník 77; číslo 3; s. 815 - 835
Hlavní autor: Sato, Shun
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.03.2017
Springer Nature B.V
Témata:
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
Degree of minor
Valuated bimatroid
90C27
Combinatorial relaxation
Discrete concavity
ISSN:0178-4617, 1432-0541
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-015-0109-4