14 citations · 47 across the 9 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018★ 10 cited
Graph connectivity in log steps using label propagation
Paul Burkhardt
The fastest deterministic algorithms for connected components take logarithmic time and perform superlinear work on a Parallel Random Access Machine (PRAM). These algorithms mainta…
math.CO2018★ 6 cited
Bounds and algorithms for graph trusses
Paul Burkhardt, Vance Faber, David G. Harris
The -truss, introduced by Cohen (2005), is a graph where every edge is incident to at least triangles. This is a relaxation of the clique. It has proved to be a useful tool…