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

From MaRDI portal
Revision as of 14:59, 18 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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