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

First Page		Document Content
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 List Source URL: mmds-data.org Download Document from Source Website File Size: 11,73 KB Share Document on Facebook