Fast computation of a longest increasing subsequence and application (Q1959440)

From MaRDI portal
Revision as of 07:45, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fast computation of a longest increasing subsequence and application
scientific article

    Statements

    Fast computation of a longest increasing subsequence and application (English)
    0 references
    0 references
    0 references
    7 October 2010
    0 references
    design and analysis of algorithms
    0 references
    longest increasing subsequence
    0 references
    longest common subsequence
    0 references
    data structures
    0 references
    priority queue
    0 references
    dynamic programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references