Solving the Nearly Symmetric All-Pairs Shortest-Path Problem (Q3386762)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Solving the Nearly Symmetric All-Pairs Shortest-Path Problem
scientific article

    Statements

    Solving the Nearly Symmetric All-Pairs Shortest-Path Problem (English)
    0 references
    0 references
    0 references
    7 January 2021
    0 references
    all-pairs shortest paths
    0 references
    repeated shortest-path algorithm
    0 references
    label-correcting algorithms
    0 references
    two-queue
    0 references
    symmetric costs
    0 references

    Identifiers