A linear time algorithm for shortest cyclic cover of strings (Q2628807)

From MaRDI portal
Revision as of 15:43, 6 August 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
A linear time algorithm for shortest cyclic cover of strings
scientific article

    Statements

    A linear time algorithm for shortest cyclic cover of strings (English)
    0 references
    0 references
    0 references
    15 July 2016
    0 references
    greedy algorithm
    0 references
    shortest cyclic cover of strings
    0 references
    superstring
    0 references
    overlap
    0 references
    minimum assignment
    0 references
    Eulerian graph
    0 references

    Identifiers