Computing almost shortest paths (Q5892152)

From MaRDI portal
Revision as of 03:22, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 6477830
Language Label Description Also known as
English
Computing almost shortest paths
scientific article; zbMATH DE number 6477830

    Statements

    Computing almost shortest paths (English)
    0 references
    0 references
    2 September 2015
    0 references
    graph algorithms
    0 references
    almost shortest paths
    0 references
    spanners
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references