Finding the <i>K</i> Shortest Loopless Paths in a Network (Q5623536)

From MaRDI portal
Revision as of 01:16, 28 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57253945, #quickstatements; #temporary_batch_1711574657256)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3347938
Language Label Description Also known as
English
Finding the <i>K</i> Shortest Loopless Paths in a Network
scientific article; zbMATH DE number 3347938

    Statements

    title
    Finding the <i>K</i> Shortest Loopless Paths in a Network (English)
    0 references
    publication date
    1971
    0 references

    Identifiers

    zbMATH DE Number
    3347938
    0 references
    OpenAlex ID
    W2011282943
    0 references
    Wikidata QID
    Q57253945
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5623536&oldid=33222535"
    Powered by MediaWiki