Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity (Q5441357)

From MaRDI portal
Revision as of 11:05, 27 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5234643
Language Label Description Also known as
English
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
scientific article; zbMATH DE number 5234643

    Statements

    Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity (English)
    0 references
    0 references
    0 references
    0 references
    11 February 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references