The shortest path with at most / nodes in each of the series/parallel clusters (Q4894863)

From MaRDI portal
Revision as of 13:42, 24 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 932506
Language Label Description Also known as
English
The shortest path with at most / nodes in each of the series/parallel clusters
scientific article; zbMATH DE number 932506

    Statements

    The shortest path with at most / nodes in each of the series/parallel clusters (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 November 1996
    0 references
    constrained shortest path problems
    0 references

    Identifiers