5 citations · 9 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2014
A Divide-and-Conquer Algorithm for Betweenness Centrality
Dora Erdos, Vatche Ishakian, Azer Bestavros +1
The problem of efficiently computing the betweenness centrality of nodes has been researched extensively. To date, the best known exact and centralized algorithm for this task is a…
cs.DS2013★ 4 cited
Scalable Boolean Tensor Factorizations using Random Walks
Dóra Erdős, Pauli Miettinen
Tensors are becoming increasingly common in data mining, and consequently, tensor factorizations are becoming more and more important tools for data miners. When the data is binary…