Timeline for Methods to approximate the betweenness centrality on large networks
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 1, 2016 at 13:07 | comment | added | Mathias Rav | How do you show that the error is O(k^(-1/2))? Also, what happens if the degrees obey a power law, i.e., a few nodes have very high degree, but most nodes have low degree? | |
| Sep 2, 2013 at 0:26 | history | answered | ericf | CC BY-SA 3.0 |