Brandes (Weighted Betweenness Centrality (BC))
Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(nm + n^{2} \log n)$ == Space Complexity == $O(n + m)$ (https://www.tandfonline.com/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/doi/abs/10.1080/0022250x.2001.9990249")
Time Complexity
$O(nm + n^{2} \log n)$
Space Complexity
$O(n + m)$
(https://www.tandfonline.com/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/doi/abs/10.1080/0022250x.2001.9990249