Journal
INFORMATION PROCESSING LETTERS
Volume 76, Issue 1-2, Pages 7-11Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/S0020-0190(00)00124-1
Keywords
algorithms; longest increasing subsequence; Van Emde Boas tree
Categories
Ask authors/readers for more resources
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. (C) 2000 Elsevier Science B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available