A fully dynamic approximation scheme for shortest paths in planar graphs (Q1273930)

From MaRDI portal
Revision as of 10:55, 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
A fully dynamic approximation scheme for shortest paths in planar graphs
scientific article

    Statements

    title
    A fully dynamic approximation scheme for shortest paths in planar graphs (English)
    0 references
    DOI
    10.1007/PL00009223
    0 references
    published in
    Algorithmica
    0 references
    publication date
    6 January 1999
    0 references
    zbMATH DE Number
    1236699
    0 references
    zbMATH Keywords
    sparse substitute graph
    0 references
    author
    Philip N. Klein
    0 references
    Sairam Subramanian
    0 references
    OpenAlex ID
    W2028558845
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1273930&oldid=37179733"
    Powered by MediaWiki