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: | Hassidim, Avinatan (Author), Onak, Krzysztof (Author), Edelman, Alan (Contributor), Nguyen, Huy N. (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer-Verlag,
2012-04-11T21:05:58Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Local graph partitions for approximation and testing
by: Hassidim, Avinatan, et al.
Published: (2010) -
On the treewidths of graphs of bounded degree.
by: Yinglei Song, et al.
Published: (2015-01-01) -
Searching for optimal caterpillars in general and bounded treewidth graphs
by: Khosravani, Masoud
Published: (2011) -
The stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
by: Cardinal, Jean, et al.
Published: (2011) -
Treewidth of Graphs and Algorithmic Implications
by: Wallgren, Anton
Published: (2020)