most citedA Feasible Graph Partition Framework for Random Walks Implemented by Parallel Computing in Big Graph

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.SI2014★ 2 cited

A Feasible Graph Partition Framework for Random Walks Implemented by Parallel Computing in Big Graph

Xiaoming Liu, Yadong Zhou, Xiaohong Guan

Graph partition is a fundamental problem of parallel computing for big graph data. Many graph partition algorithms have been proposed to solve the problem in various applications,…