Lower bounds for fully dynamic connectivity problems in graphs (Q1273940)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Lower bounds for fully dynamic connectivity problems in graphs
scientific article

    Statements

    Lower bounds for fully dynamic connectivity problems in graphs (English)
    0 references
    0 references
    0 references
    0 references
    5 July 1999
    0 references
    dynamic connectivity problems
    0 references

    Identifiers