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: | Elizabeth J. Itskovich, Vadim E. Levit |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-11-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/12/11/237 |
Similar Items
-
Small Longest Tandem Scattered Subsequences
by: Luıs M. S. Russo, et al.
Published: (2021-08-01) -
The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets
by: Al-Meanazel, Ayat
Published: (2015) -
A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem
by: Zhan Peng, et al.
Published: (2017-08-01) -
Intersections of Longest Paths and Cycles
by: Hippchen, Thomas
Published: (2008) -
Intersecting longest paths and longest cycles: A survey
by: Ayesha Shabbir, et al.
Published: (2013-04-01)