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

From MaRDI portal
Revision as of 04:33, 14 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
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
    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