Some modified algorithms for Dijkstra's longest upsequence problem (Q1161300): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:54, 31 January 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
