1 citations · 1 across the 5 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
physics.soc-ph2016
Scaling of random walk betweenness in networks
O. Narayan, I. Saniee
The betweenness centrality of graphs using random walk paths instead of geodesics is studied. A scaling collapse with no adjustable parameters is obtained as the graph size is…
cs.DS2016
Fast approximation algorithms for -centres in large -hyperbolic graphs
Katherine Edwards, W. Sean Kennedy, Iraj Saniee
We provide a quasilinear time algorithm for the -center problem with an additive error less than or equal to 3 times the input graph's hyperbolic constant. Specifically, for the…