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 - Shortest path problem - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2016-06-23 15:50:48 Open Document File Size: 11,73 KB Share Result on Facebook

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