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

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 77; no. 3; pp. 815 - 835
Main Author:	Sato, Shun
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.03.2017 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!