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

From MaRDI portal
Revision as of 16:17, 23 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(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

    Semi-dynamic breadth-first search in digraphs (English)
    0 references
    0 references
    0 references
    0 references
    12 December 2000
    0 references
    0 references
    breadth-first search tree
    0 references
    incremental algorithms
    0 references
    decremental algorithms
    0 references
    shortest paths
    0 references
    amortized analysis
    0 references