![](https://www.pdfsearch.io/img/32c9d8058e99319631b5832663eddc2f.jpg) Date: 2016-06-23 15:50:48
| | We approach the problem of computing geometric centralities, such as closeness and harmonic centrality, on very large graphs; traditionally this task requires an all-pairs shortest-path computation in the exact case, or Add to Reading ListSource URL: mmds-data.orgDownload Document from Source Website File Size: 11,73 KBShare Document on Facebook
|