Inicio  /  Algorithms  /  Vol: 12 Par: 11 (2019)  /  Artículo
ARTÍCULO
TITULO

What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other?

Elizabeth J. Itskovich and Vadim E. Levit    

Resumen

As a kind of converse of the celebrated Erdos?Szekeres theorem, we present a necessary and sufficient condition for a sequence of length n to contain a longest increasing subsequence and a longest decreasing subsequence of given lengths x and y, respectively.

 Artículos similares