Near-Linear Lower Bounds for Testing Directed AcyclicityResearch Paper
Property testing asks for algorithms that inspect a tiny part of a large object and distinguish objects with a property from objects that are far from it (Goldreich, Goldwasser, Ron 1998). For sparse directed graphs, the natural access model is the bounded-degree incidence-lists model of Bender and Ron (2002): the algorithm may ask for the outgoing edges of…