Fault-tolerant approximate shortest-path trees (Q1799205)

From MaRDI portal
Revision as of 23:07, 16 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
Fault-tolerant approximate shortest-path trees
scientific article

    Statements

    title
    Fault-tolerant approximate shortest-path trees (English)
    0 references
    author
    Davide Bilò
    0 references
    Luciano Gualà
    0 references
    Stefano Leucci
    0 references
    Guido Proietti
    0 references
    published in
    Algorithmica
    0 references
    publication date
    18 October 2018
    0 references
    zbMATH Keywords
    shortest-path trees
    0 references
    fault-tolerant structures
    0 references
    approximate distances
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C12
    0 references
    05C05
    0 references
    05C38
    0 references
    68M15
    0 references
    68P05
    0 references
    68R10
    0 references
    zbMATH DE Number
    6958237
    0 references
    OpenAlex ID
    W2768785137
    0 references
    arXiv ID
    1407.0637
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1799205&oldid=36437500"
    Powered by MediaWiki