Computing Top-<i>k</i> Closeness Centrality in Fully-dynamic Graphs (Q5232720)

From MaRDI portal
scientific article; zbMATH DE number 7104613
Language Label Description Also known as
English
Computing Top-<i>k</i> Closeness Centrality in Fully-dynamic Graphs
scientific article; zbMATH DE number 7104613

    Statements

    Computing Top-<i>k</i> Closeness Centrality in Fully-dynamic Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 September 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references