1 citations · 1 across the 4 of their papers we have counts for
1 paper · 1 filter
Matthew Drescher, Muhammad A. Awad, Serban D. Porumbescu +1
We describe a simple parallel-friendly lightweight graph reordering algorithm for COO graphs (edge lists). Our ``Batched Order By Attachment'' (BOBA) algorithm is linear in the num…