An algorithm for finding shortest routes from all source nodes to a given destination in general networks (Q5608702)

From MaRDI portal
Revision as of 02:52, 30 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3330674
Language Label Description Also known as
English
An algorithm for finding shortest routes from all source nodes to a given destination in general networks
scientific article; zbMATH DE number 3330674

    Statements

    An algorithm for finding shortest routes from all source nodes to a given destination in general networks (English)
    0 references
    0 references
    0 references
    1970
    0 references
    0 references