FastBFS: Fast Breadth-First Graph Search on a Single Server


Big graph computing can be performed over a single node, using recent systems such as GraphChi and XStream. Breadth-first graph search (a.k.a., BFS) has a pattern of marking each vertex only once as “visited” and then not using them in further computations. Existing single-server graph computing systems fail to take advantage of such access… (More)
DOI: 10.1109/IPDPS.2016.71


12 Figures and Tables