Query Complexity of Densest Sub(hyper)graph Problems

Sinan G. Aksoy, Eli Friedman, Nate Veldt +1

Rubinstein et al. introduce the study of connectivity and minimum cut problems in the cut query model, where an algorithm can only access the edges of a graph through CUT queries.…