An improved lower bound for competitive graph exploration (Q831137)

From MaRDI portal
Revision as of 03:41, 6 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
An improved lower bound for competitive graph exploration
scientific article

    Statements

    An improved lower bound for competitive graph exploration (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 May 2021
    0 references
    graph exploration
    0 references
    online algorithms
    0 references
    competitive analysis
    0 references
    competitive ratio
    0 references

    Identifiers