Lower and upper competitive bounds for online directed graph exploration (Q343923)

From MaRDI portal
Revision as of 00:56, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Lower and upper competitive bounds for online directed graph exploration
scientific article

    Statements

    title
    Lower and upper competitive bounds for online directed graph exploration (English)
    0 references
    author
    Klaus-Tycho Foerster
    0 references
    Roger Wattenhofer
    0 references
    publication date
    29 November 2016
    0 references
    Mathematics Subject Classification ID
    90C35
    0 references
    90C27
    0 references
    68W27
    0 references
    zbMATH DE Number
    6657245
    0 references
    zbMATH Keywords
    graph exploration
    0 references
    online algorithms
    0 references
    competitive analysis
    0 references
    directed graphs
    0 references
    OpenAlex ID
    W2262759985
    0 references
    Wikidata QID
    Q57310485
    0 references
    cites work
    Q5417632
    0 references
    Q3090934
    0 references
    Q4223058
    0 references
    Why Robots Need Maps
    0 references
    Q4426350
    0 references
    STACS 2004
    0 references
    Search games
    0 references
    Q4159394
    0 references
    Q3208679
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q343923&oldid=36290553"
    Powered by MediaWiki