Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs (Q5025042): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: KADABRA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / 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: A faster algorithm for betweenness centrality* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Betweenness Centrality of a Node by Adding Links / 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: CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The centrality of groups and classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5852580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Betweenness Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Approximation of Betweenness Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding Machine Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4606289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Betweenness Centrality in Large Evolving Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3216770752 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:55, 30 July 2024

scientific article; zbMATH DE number 7467831
Language Label Description Also known as
English
Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs
scientific article; zbMATH DE number 7467831

    Statements

    Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs (English)
    0 references
    0 references
    0 references
    1 February 2022
    0 references
    social networks
    0 references
    directed graphs
    0 references
    betweenness centrality
    0 references
    exact algorithm
    0 references
    approximate algorithm
    0 references

    Identifiers