Fast recommendation on bibliographic networks with sparse-matrix ordering and partitioning

Graphs and matrices are widely used in algorithms for social network analyses. Since the number of interactions is much less than the possible number of interactions, the graphs and matrices used in the analyses are usually sparse. In this paper, we propose an efficient implementation of a sparse-ma...

Ausführliche Beschreibung