All shortest distances in a graph. An improvement to Dantzig's inductive algorithm (Q2559493)

From MaRDI portal
Revision as of 06:12, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
All shortest distances in a graph. An improvement to Dantzig's inductive algorithm
scientific article

    Statements

    title
    All shortest distances in a graph. An improvement to Dantzig's inductive algorithm (English)
    0 references
    author
    Yves Tabourier
    0 references
    publication date
    1973
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05-04
    0 references
    05C35
    0 references
    03E05
    0 references
    zbMATH DE Number
    3405998
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2559493&oldid=15308664"
    Powered by MediaWiki