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

From MaRDI portal
Revision as of 19:22, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(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

    title
    Fast algorithms to enumerate all common intervals of two permutations (English)
    0 references
    DOI
    10.1007/s004539910014
    0 references
    author
    Takeaki Uno
    0 references
    Mutsunori Yagiura
    0 references
    published in
    Algorithmica
    0 references
    publication date
    19 March 2000
    0 references
    zbMATH DE Number
    1417541
    0 references
    zbMATH Keywords
    common intervals of permutations
    0 references
    random permutations
    0 references
    OpenAlex ID
    W2044007697
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1969959&oldid=31303844"
    Powered by MediaWiki