Faster swap edge computation in minimum diameter spanning trees (Q2428664)

From MaRDI portal
Revision as of 03:36, 5 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
Faster swap edge computation in minimum diameter spanning trees
scientific article

    Statements

    title
    Faster swap edge computation in minimum diameter spanning trees (English)
    0 references
    author
    Beat Gfeller
    0 references
    published in
    Algorithmica
    0 references
    publication date
    26 April 2012
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    05C82
    0 references
    68M10
    0 references
    68M15
    0 references
    zbMATH DE Number
    6028420
    0 references
    zbMATH Keywords
    graph algorithms
    0 references
    minimum diameter spanning tree
    0 references
    transient edge failures
    0 references
    fault tolerance
    0 references
    OpenAlex ID
    W1984971117
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2428664&oldid=35274962"
    Powered by MediaWiki