OpenAlex
Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation
Work