Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs (Q5025042)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs |
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
