Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality (Q4577956): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1602.00963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3108696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Betweenness Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Merging of Frontiers for Accelerating the Evaluation of 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: Fuzzy System Methods in Modeling Gene Expression and Analyzing Protein Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Approximation of Betweenness Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community structure in social and biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology manipulations for speeding betweenness centrality computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation of betweenness centrality through sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4397004 / rank
 
Normal rank

Latest revision as of 06:56, 16 July 2024

scientific article; zbMATH DE number 6913943
Language Label Description Also known as
English
Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality
scientific article; zbMATH DE number 6913943

    Statements

    Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 August 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    betweenness centrality
    0 references
    GPU computing
    0 references
    graph algorithms
    0 references
    large-scale graphs
    0 references
    parallel algorithm
    0 references
    shortest paths
    0 references
    0 references
    0 references