Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms (Q1274331)

From MaRDI portal
Revision as of 22:38, 17 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
Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms
scientific article

    Statements

    Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms (English)
    0 references
    12 January 1999
    0 references
    shortest path
    0 references
    graph theory
    0 references
    treewidth
    0 references
    parallel computing
    0 references
    PRAM
    0 references
    dynamic algorithm
    0 references

    Identifiers