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, orAdd to Reading ListSource URL: mmds-data.orgDownload Document from Source WebsiteFile Size: 11,73 KBShare Document on Facebook |