Semi-dynamic breadth-first search in digraphs (Q1589436)

From MaRDI portal
Revision as of 09:36, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Semi-dynamic breadth-first search in digraphs
scientific article

    Statements

    title
    Semi-dynamic breadth-first search in digraphs (English)
    0 references
    publication date
    12 December 2000
    0 references
    zbMATH DE Number
    1542265
    0 references
    zbMATH Keywords
    breadth-first search tree
    0 references
    incremental algorithms
    0 references
    decremental algorithms
    0 references
    shortest paths
    0 references
    amortized analysis
    0 references
    author
    Paolo Giulio Franciosa
    0 references
    Daniele Frigioni
    0 references
    Roberto Giaccio
    0 references
    Wikidata QID
    Q127061336
    0 references
    OpenAlex ID
    W2031209474
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1589436&oldid=36914135"
    Powered by MediaWiki