𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the longest increasing subsequence of a circular list

✍ Scribed by M.H. Albert; M.D. Atkinson; Doron Nussbaum; Jörg-Rüdiger Sack; Nicola Santoro


Book ID
108153484
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
125 KB
Volume
101
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


An algorithm for the determination of a
✍ M. Orlowski; M. Pachter 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 171 KB

We present a simple, novel and efficient algorithm for the determination of a longest increasing subsequence in a given sequence of ,, numbers. Our algorithm performs in O(,~ log r) time in the worst case, where r is the size of the output, i.e. r is the length of the longest increasing subsequence