paper

Path algebra algorithm for finding longest increasing subsequence

arXiv:1409.2928

Abstract

New algorithm for finding longest increasing subsequence is discussed. This algorithm is based on the ideas of idempotent mathematics and uses Max-Plus idempotent semiring. Problem of finding longest increasing sub- sequence is reformulated in a matrix form and solved with linear algebra.

References in corpus (1)