Some modified algorithms for Dijkstra's longest upsequence problem (Q1161300)

From MaRDI portal
Revision as of 09:43, 14 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    1982
    0 references
    merge algorithms
    0 references
    merging
    0 references
    sorting
    0 references

    Identifiers