Two disjoint shortest paths problem with non-negative edge length (Q2294269)

From MaRDI portal
Revision as of 18:25, 21 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Two disjoint shortest paths problem with non-negative edge length
scientific article

    Statements

    Two disjoint shortest paths problem with non-negative edge length (English)
    0 references
    0 references
    0 references
    10 February 2020
    0 references
    disjoint paths
    0 references
    shortest path
    0 references
    polynomial-time algorithm
    0 references

    Identifiers