Compact navigation and distance oracles for graphs with small treewidth (Q472468)

From MaRDI portal
Revision as of 08:19, 9 July 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
Compact navigation and distance oracles for graphs with small treewidth
scientific article

    Statements

    title
    Compact navigation and distance oracles for graphs with small treewidth (English)
    0 references
    author
    Arash Farzan
    0 references
    Shahin Kamali
    0 references
    published in
    Algorithmica
    0 references
    publication date
    19 November 2014
    0 references
    zbMATH Keywords
    graph decomposition
    0 references
    treewidth
    0 references
    navigation oracles
    0 references
    distance oracles
    0 references
    cites work
    Q4471358
    0 references
    Q4291429
    0 references
    Q4255109
    0 references
    Asymmetric graphs
    0 references
    Q4471381
    0 references
    Q3734422
    0 references
    The number of trees
    0 references
    Q5417613
    0 references
    Q4796165
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C70
    0 references
    05C12
    0 references
    68R10
    0 references
    zbMATH DE Number
    6371098
    0 references
    OpenAlex ID
    W1988115395
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q472468&oldid=35423368"
    Powered by MediaWiki