Some modified algorithms for Dijkstra's longest upsequence problem (Q1161300): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00625277 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2024244897 / rank | |||
Normal rank |
Latest revision as of 11:54, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some modified algorithms for Dijkstra's longest upsequence problem |
scientific article |
Statements
Some modified algorithms for Dijkstra's longest upsequence problem (English)
0 references
1982
0 references
merge algorithms
0 references
merging
0 references
sorting
0 references