Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393)

From MaRDI portal
Revision as of 06:02, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs
scientific article

    Statements

    title
    Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (English)
    0 references
    author
    Qian-Ping Gu
    0 references
    Gengchun Xu
    0 references
    publication date
    20 February 2019
    0 references
    zbMATH Keywords
    distance oracle
    0 references
    planar graphs
    0 references
    approximate algorithms
    0 references
    graph decomposition
    0 references

    Identifiers

    zbMATH DE Number
    7026785
    0 references
    OpenAlex ID
    W2889518945
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1727393&oldid=38715697"
    Powered by MediaWiki