A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Degree-3 Treewidth Sparsifiers
[chapter]
2014
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
We study treewidth sparsifiers. Informally, given a graph G of treewidth k, a treewidth sparsifier H is a minor of G, whose treewidth is close to k, |V (H)| is small, and the maximum vertex degree in H is bounded. Treewidth sparsifiers of degree 3 are of particular interest, as routing on node-disjoint paths, and computing minors seems easier in sub-cubic graphs than in general graphs. In this paper we describe an algorithm that, given a graph G of treewidth k, computes a topological minor H of
doi:10.1137/1.9781611973730.19
dblp:conf/soda/ChekuriC15
fatcat:mqjnteicoffrvgildnjatz7w6u