Brandes (Unweighted Betweenness Centrality (BC))

From Algorithm Wiki

Revision as of 10:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(nm)$ == 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")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(nm)$

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_(Unweighted_Betweenness_Centrality_(BC))&oldid=45089"