Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length (Q3477968)

From MaRDI portal
Revision as of 20:13, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
scientific article

    Statements

    Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length (English)
    0 references
    0 references
    0 references
    1990
    0 references
    computations on discrete structures
    0 references
    graph algorithms
    0 references
    path and
    0 references
    circuit problems
    0 references
    network algorithms
    0 references
    shortest paths
    0 references
    functional
    0 references
    complexity
    0 references
    time dependency
    0 references
    waiting times
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references