Competitive Algorithms for Layered Graph Traversal (Q4210157)

From MaRDI portal
Revision as of 08:47, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1200797
Language Label Description Also known as
English
Competitive Algorithms for Layered Graph Traversal
scientific article; zbMATH DE number 1200797

    Statements

    title
    Competitive Algorithms for Layered Graph Traversal (English)
    0 references
    author
    Dean P. Foster
    0 references
    Yuval Rabani
    0 references
    Y. Ravid
    0 references
    Amos Fiat
    0 references
    Howard J. Karloff
    0 references
    publication date
    21 September 1998
    0 references
    zbMATH Keywords
    competitive analysis
    0 references
    layered graphs
    0 references
    search strategies
    0 references

    Identifiers

    zbMATH DE Number
    1200797
    0 references
    OpenAlex ID
    W2171330236
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4210157&oldid=36946190"
    Powered by MediaWiki