Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees (Q4337633)

From MaRDI portal
Revision as of 09:52, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1012872
Language Label Description Also known as
English
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
scientific article; zbMATH DE number 1012872

    Statements

    Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees (English)
    0 references
    26 May 1997
    0 references
    0 references
    analysis of algorithms
    0 references
    data structures
    0 references
    embedded planar graph
    0 references
    fully persistent data structures
    0 references
    k smallest spanning trees
    0 references
    minimum spanning tree
    0 references
    on-line updating
    0 references
    topology tree
    0 references
    2-edge-connectivity
    0 references
    0 references
    0 references