collaborators

1 paper

cs.DS2025

Sink-free orientations: a local sampler with applications

Konrad Anand, Graham Freifeld, Heng Guo +2

For sink-free orientations in graphs of minimum degree at least , we show that there is a deterministic approximate counting algorithm that runs in time $O((n^{73}/\varepsilon^{…