2 papers
cs.DS2026
Four-Cycle Counting in Low-Degeneracy Graph Streams
Sebastian Lüderssen, Stefan Neumann, Pan Peng
We study the problem of -approximating the number of four-cycles in graphs given as arbitrary order edge streams. We propose two new algorithms based on sampling i…
cs.DS2026
Near-Optimal Four-Cycle Counting in Graph Streams
Sebastian Lüderssen, Stefan Neumann, Pan Peng
We study four-cycle counting in arbitrary order graph streams. We present a 3-pass algorithm for -approximating the number of four-cycles using $\widetilde{O}(m/\s…