An efficient partitioning oracle for bounded-treewidth graphs
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 nu...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer-Verlag,
2012-04-11T21:05:58Z.
|
| Subjects: | |
| Online Access: | Get fulltext |