Brandes (Weighted Betweenness Centrality (BC))

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(nm + n^{2} \log n)$

Space Complexity

$O(n + m)$

(https://www-tandfonline-com.ezproxy.canberra.edu.au/doi/abs/10.1080/0022250x.2001.9990249)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

not mentioned

Year

2000

Reference

https://www-tandfonline-com.ezproxy.canberra.edu.au/doi/abs/10.1080/0022250x.2001.9990249

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Brandes_(Weighted_Betweenness_Centrality_(BC))&oldid=45090"