Computer Science – Data Structures and Algorithms
Scientific paper
2011-06-22
Computer Science
Data Structures and Algorithms
Full version of a paper to appear in RANDOM 2011
Scientific paper
Partitioning oracles were introduced by Hassidim et al. (FOCS 2009) as a generic tool for constant-time algorithms. For any epsilon > 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/epsilon), and the number of edges removed is at most epsilon*n, where n is the number of vertices in the graph. However, the oracle of Hassidimet al. makes an exponential number of queries to the input graph to answer every query about the partition. In this paper, we construct an efficient partitioning oracle for graphs with constant treewidth. The oracle makes only O(poly(1/epsilon)) queries to the input graph to answer each query about the partition. Examples of bounded-treewidth graph classes include k-outerplanar graphs for fixed k, series-parallel graphs, cactus graphs, and pseudoforests. Our oracle yields poly(1/epsilon)-time property testing algorithms for membership in these classes of graphs. Another application of the oracle is a poly(1/epsilon)-time algorithm that approximates the maximum matching size, the minimum vertex cover size, and the minimum dominating set size up to an additive epsilon*n in graphs with bounded treewidth. Finally, the oracle can be used to test in poly(1/epsilon) time whether the input bounded-treewidth graph is k-colorable or perfect.
Edelman Alan
Hassidim Avinatan
Nguyen Huy N.
Onak Krzysztof
No associations
LandOfFree
An Efficient Partitioning Oracle for Bounded-Treewidth Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Efficient Partitioning Oracle for Bounded-Treewidth Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Efficient Partitioning Oracle for Bounded-Treewidth Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-469159