Efficient algorithms for updating betweenness centrality in fully dynamic graphs (Q1750422): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ins.2015.07.053 / rank
Normal rank
 
Property / author
 
Property / author: Sung Hee Choi / rank
Normal rank
 
Property / author
 
Property / author: Sung Hee Choi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 447 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ins.2015.07.053 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1439932879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The university of Florida sparse matrix collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygonal approximation of digital planar curves through vertex betweenness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Betweenness Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm for betweenness centrality* / rank
 
Normal rank
Property / cites work
 
Property / cites work: CENTRALITY ESTIMATION IN LARGE NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to dynamic all pairs shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental analysis of dynamic all pairs shortest path algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing betweenness centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Approximation of Betweenness Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm to Update Betweenness Centrality after Node Alteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case update times for fully-dynamic all-pairs shortest paths / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.INS.2015.07.053 / rank
 
Normal rank

Latest revision as of 08:09, 11 December 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for updating betweenness centrality in fully dynamic graphs
scientific article

    Statements

    Efficient algorithms for updating betweenness centrality in fully dynamic graphs (English)
    0 references
    0 references
    0 references
    0 references
    22 May 2018
    0 references
    betweenness centrality
    0 references
    update algorithm
    0 references
    biconnected component
    0 references
    dynamic graph
    0 references
    community detection
    0 references

    Identifiers