What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other?
As a kind of converse of the celebrated Erdős−Szekeres theorem, we present a necessary and sufficient condition for a sequence of length <i>n</i> to contain a longest increasing subsequence and a longest decreasing subsequence of given lengths <i>x</i> and <i>...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-11-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-4893/12/11/237 |