Fast algorithms to enumerate all common intervals of two permutations (Q1969959)

From MaRDI portal
Revision as of 23:51, 29 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
Fast algorithms to enumerate all common intervals of two permutations
scientific article

    Statements

    Fast algorithms to enumerate all common intervals of two permutations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 March 2000
    0 references
    0 references
    common intervals of permutations
    0 references
    random permutations
    0 references