Computing almost shortest paths (Q5892152)

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

    Statements

    title
    Computing almost shortest paths (English)
    0 references
    author
    Michael Elkin
    0 references
    publication date
    2 September 2015
    0 references
    zbMATH Keywords
    graph algorithms
    0 references
    almost shortest paths
    0 references
    spanners
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C35
    0 references
    05C38
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6477830
    0 references
    OpenAlex ID
    W1987669032
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5892152&oldid=32979914"
    Powered by MediaWiki