Ein Algorithmus zur Ermittlung k-bester Kantenfolgen zwischen allen Ecken eines Graphen (Q2557122)

From MaRDI portal
Revision as of 11:48, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Ein Algorithmus zur Ermittlung k-bester Kantenfolgen zwischen allen Ecken eines Graphen
scientific article

    Statements

    title
    Ein Algorithmus zur Ermittlung k-bester Kantenfolgen zwischen allen Ecken eines Graphen (English)
    0 references
    author
    H. Beilner
    0 references
    published in
    Computing
    0 references
    publication date
    1972
    0 references
    cites work
    Q5655387
    0 references
    Q5623510
    0 references

    Identifiers

    DOI
    10.1007/BF02316908
    0 references
    zbMATH DE Number
    3397081
    0 references
    OpenAlex ID
    W100861594
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2557122&oldid=37349041"
    Powered by MediaWiki