Finding shorter cycles in a weighted graph (Q5964975)

From MaRDI portal
Revision as of 06:19, 22 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6548073
Language Label Description Also known as
English
Finding shorter cycles in a weighted graph
scientific article; zbMATH DE number 6548073

    Statements

    Finding shorter cycles in a weighted graph (English)
    0 references
    0 references
    0 references
    0 references
    2 March 2016
    0 references
    fundamental cycle
    0 references
    Dijkstra's algorithm
    0 references
    \(3\)-path-condition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references