共 105 条
[1]
Bader DA(2006)Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs J Parall Distr Comput 66 1366-1378
[2]
Cong G(2015)Large scale graph processing systems: survey and an experimental evaluation Clust Comput 18 1189-1213
[3]
Batarfi O(2016)The end of slow networks: it’s time for a redesign Proc VLDB Endowm 9 528-539
[4]
El S R(2001)A faster algorithm for betweenness centrality J Math Sociol 25 163-177
[5]
Fayoumi AG(2010)HaLoop: efficient iterative data processing on large clusters Proc VLDB Endowm 3 285-296
[6]
Binnig C(2014)Pregelix: big(ger) graph analytics on a dataflow engine Proc VLDB Endowm 8 161-172
[7]
Crotty A(2010)More algorithms for all-pairs shortest paths in weighted graphs SIAM J Comput 39 2075-2089
[8]
Galakatos A(2015)Optimal enumeration: efficient top- Proc VLDB Endowm 8 533-544
[9]
Brandes U(1983) tree matching IEEE Trans Softw Eng 9 504-512
[10]
Bu YY(2008)Graph traversal techniques and the maximum flow problem in distributed computation Commun ACM 51 107-113