Optimal Padded Decomposition For Bounded Treewidth Graphs

Arnold Filtser, Tobias Friedrich, Davis Issac +4

A $({\hat{I}}^2,\hat{I}´,\hat{I}”)$-padded decomposition of an edge-weighted graph $G=(V,E,w)$ is a stochastic decomposition into clusters of diameter at most $\hat{I}”$ such that for every vertex $v\in V$…