Path algebra algorithm for finding longest increasing subsequence
Data Structures and Algorithms
2014-09-11 v1
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.
Cite
@article{arxiv.1409.2928,
title = {Path algebra algorithm for finding longest increasing subsequence},
author = {Anatoly Rodionov},
journal= {arXiv preprint arXiv:1409.2928},
year = {2014}
}