On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs (Q1254332)

From MaRDI portal
Revision as of 00:18, 13 June 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
On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs
scientific article

    Statements

    title
    On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs (English)
    0 references
    author
    Kohei Noshita
    0 references
    Etsuo Masuda
    0 references
    Hajime Machida
    0 references
    publication date
    1978
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C38
    0 references
    05C05
    0 references
    05-04
    0 references
    05C35
    0 references
    zbMATH DE Number
    3618203
    0 references
    OpenAlex ID
    W2020556531
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1254332&oldid=34620982"
    Powered by MediaWiki