Enumerating longest increasing subsequences and patience sorting

Sergei Bespamyatnikh, Michael Segal

Research output: Contribution to journalArticlepeer-review

63 Scopus citations

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.

Original languageEnglish
Pages (from-to)7-11
Number of pages5
JournalInformation Processing Letters
Volume76
Issue number1-2
DOIs
StatePublished - 20 Nov 2000
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Enumerating longest increasing subsequences and patience sorting'. Together they form a unique fingerprint.

Cite this