New Polynomial Shortest Path Algorithms and Their Computational Attributes (Q3750535)

From MaRDI portal
Revision as of 21:08, 20 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
New Polynomial Shortest Path Algorithms and Their Computational Attributes
scientific article

    Statements

    New Polynomial Shortest Path Algorithms and Their Computational Attributes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    polynomially bounded partitioning shortest path
    0 references
    computational testing
    0 references
    sharp variants
    0 references
    near-sharp variants
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references