Showing cs.DSShow all
2 papers · 1 filter
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.DS2025
OptiRefine: Densest subgraphs and maximum cuts with refinements
Sijing Tu, Aleksa Stankovic, Stefan Neumann +1
Data-analysis tasks often involve an iterative process, which requires refining previous solutions. For instance, when analyzing dynamic social networks, we may be interested in mo…