An improved lower bound for competitive graph exploration (Q831137)

From MaRDI portal
Revision as of 16:59, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
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