Online graph exploration: New results on old and new algorithms (Q1929219)

From MaRDI portal
Revision as of 02:00, 5 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57399761, #quickstatements; #temporary_batch_1712272666262)
scientific article
Language Label Description Also known as
English
Online graph exploration: New results on old and new algorithms
scientific article

    Statements

    title
    Online graph exploration: New results on old and new algorithms (English)
    0 references
    author
    Nicole Megow
    0 references
    Kurt Mehlhorn
    0 references
    Pascal Schweitzer
    0 references
    publication date
    7 January 2013
    0 references
    zbMATH Keywords
    graph exploration
    0 references
    online algorithms
    0 references
    competitive analysis
    0 references

    Identifiers

    zbMATH DE Number
    6122456
    0 references
    OpenAlex ID
    W105334049
    0 references
    Wikidata QID
    Q57399761
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1929219&oldid=33247092"
    Powered by MediaWiki