Loading...
Please wait, while we are loading the content...
Similar Documents
Enumerating Longest Increasing Subsequences and Patience Sorting Enumerating Longest Increasing Subsequences and Patience Sorting
| Content Provider | Semantic Scholar |
|---|---|
| Author | Segal, Michael |
| Copyright Year | 2000 |
| Abstract | In this paper we present three algorithms that solve three combinatorial optimization problems related to each other. One of them is the patience sorting game, invented as a practical method of sorting real decks of cards. The second problem is computing the longest monotone increasing subsequence of the given sequence of n positive integers in the range 1; : : : ; n. The third problem is to enumerate all the longest monotone increasing subsequences of the given permutation. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.pims.math.ca/publications/preprints/bespamyatnikh-segal_6-12-99.ps |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
