An algorithm for the determination of longest increasing subsequence in a sequence

DOI10.1016/0898-1221(89)90036-9zbMath0671.05002OpenAlexW2079700310MaRDI QIDQ1119638

S. H. Smith

Publication date: 1989

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(89)90036-9

zbMATH Keywords

longest increasing subsequence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Sequences and sets (11B99)

Related Items (3)

Drawing graphs in two layers ⋮ A review of metrics on permutations for search landscape analysis ⋮ The analysis of evolutionary algorithms on sorting and shortest paths problems

Cites Work

• Unnamed Item
• An efficient algorithm for maxdominance, with applications
• Some beautiful arguments using mathematical induction
• Some modified algorithms for Dijkstra's longest upsequence problem

This page was built for publication: An algorithm for the determination of longest increasing subsequence in a sequence