An Efficient Partitioning Oracle for Bounded-Treewidth Graphs

Alan Edelman, Avinatan Hassidim, Huy N. Nguyen, Krzysztof Onak

Abstract: Partitioning oracles were introduced by Hassidim et al. (FOCS 2009) as a generic tool for constant-time algorithms. For any ε > 0, a partitioning oracle provides query access to a fixed partition of the input bounded-degree minor-free graph, in which every component has size poly(1/ε), and the number of edges removed is at most εn, where n is the number of vertices in the graph.