For sparse graphs, Censor-Hillel, Le Gall, and Leitersdorf [1]} show that listing can be complete within \(\tilde{O}(m/n^{1+2/p}+1) \)  rounds, for \(p \ge 3\) . This follows from their \(\mathsf {CONGEST}\)  approach which is discussed below, and is tight up to polylogarithmic factors using the lower bound technique of [2]}, [3]}, [4]}. This complexity was later obtained in a deterministic manner by Censor-Hillel, Fischer, Gonen, Le Gall, Leitersdorf, and Oshman [5]}.
