A graph with low average degree

[107034503]

Hello, I'm a big fan of pruned landmark labeling. I'm dealing with a graph where the average degree is very low (under 3). I would like to know if the bit-parallel technique works as efficiently as the graph in the paper.

Thanks.