Ein leistungsfähiger Algorithmus zur Bestimmung von K-kürzesten Wegen in einem Graphen (Q1394122)

From MaRDI portal
Revision as of 14:21, 12 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
Ein leistungsfähiger Algorithmus zur Bestimmung von K-kürzesten Wegen in einem Graphen
scientific article

    Statements

    title
    Ein leistungsfähiger Algorithmus zur Bestimmung von K-kürzesten Wegen in einem Graphen (English)
    0 references
    DOI
    10.1007/BF02293111
    0 references
    author
    M. M. Weigand
    0 references
    published in
    Computing
    0 references
    publication date
    1974
    0 references
    Mathematics Subject Classification ID
    68W99
    0 references
    05C35
    0 references
    05-04
    0 references
    90-04
    0 references
    zbMATH DE Number
    3438386
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1394122&oldid=34561010"
    Powered by MediaWiki