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

From MaRDI portal
Revision as of 01:02, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q343923&oldid=25529488"
    Powered by MediaWiki