An algorithm for the determination of longest increasing subsequence in a sequence
type: Item
instance of: scholarly article
title: An algorithm for the determination of longest increasing subsequence in a sequence
zbMATH Open document ID: 0671.05002
DOI: 10.1016/0898-1221(89)90036-9
author: S. H. Smith
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 11B99
zbMATH DE Number: 4097379
zbMATH Keywords: longest increasing subsequence
MaRDI profile type: Publication
full work available at URL: 0898-1221(89)90036-9
OpenAlex ID: W2079700310
cites work: An efficient algorithm for maxdominance, with applications
cites work: Some beautiful arguments using mathematical induction
cites work: Some modified algorithms for Dijkstra's longest upsequence problem
cites work: Q5562640
published in: Computers & Mathematics with Applications
Recommended article: An efficient algorithm for enumerating longest common increasing subsequences
Recommended article: A fast algorithm for computing a longest common increasing subsequence
Recommended article: Efficient algorithms for finding a longest common increasing subsequence
Recommended article: Algorithms and Computation
Recommended article: Improved dynamic algorithms for longest increasing subsequence
Recommended article: Fast computation of a longest increasing subsequence and application
Recommended article: Computing the longest common almost-increasing subsequence
Recommended article: A linear space algorithm for computing a longest common increasing subsequence
Recommended article: Space-efficient algorithms for longest increasing subsequence
Recommended article: Space-Efficient Algorithms for Longest Increasing Subsequence
description: scientific article; zbMATH DE number 4097379