A loop-free shortest-path routing algorithm for dynamic networks (Q385951)

From MaRDI portal
Revision as of 04:31, 7 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
A loop-free shortest-path routing algorithm for dynamic networks
scientific article

    Statements

    A loop-free shortest-path routing algorithm for dynamic networks (English)
    0 references
    0 references
    0 references
    0 references
    13 December 2013
    0 references
    0 references
    distributed networks
    0 references
    loop-free routing
    0 references
    shortest-path
    0 references
    dynamic algorithms
    0 references
    0 references
    0 references