Approximating Shortest Paths in Graphs (Q3605483)

From MaRDI portal
Revision as of 02:40, 29 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
Approximating Shortest Paths in Graphs
scientific article

    Statements

    title
    Approximating Shortest Paths in Graphs (English)
    0 references
    publication date
    24 February 2009
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C12
    0 references
    05C85
    0 references
    68Q25
    0 references
    zbMATH DE Number
    5510247
    0 references
    author
    Sandeep Sen
    0 references
    OpenAlex ID
    W1581228220
    0 references
    cites work
    Q4471324
    0 references
    STACS 2005
    0 references
    Q2921727
    0 references
    Q4449190
    0 references
    Q5501268
    0 references
    Q2754183
    0 references
    Graph spanners
    0 references
    Q4796165
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3605483&oldid=35094481"
    Powered by MediaWiki