Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs (Q5025042): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: KADABRA / rank | |||
Normal rank |
Revision as of 21:41, 28 February 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
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