Large-treewidth graph decompositions and applications

Treewidth is a graph parameter that plays a fundamental role in several structural and algorithmic results. We study the problem of decomposing a given graph G into node-disjoint subgraphs, where each subgraph has sufficiently large treewidth. We prove two theorems on the tradeoff between the number of the desired subgraphs h, and the desired lower bound r on the treewidth of each subgraph. The theorems assert that, given a graph G with treewidth k, a decomposition with parameters h,r is feasible whenever hr2 ≤ k/polylog(k), or h3r ≤ k/polylog(k) holds. We then show a framework for using these theorems to bypass the well-known Grid-Minor Theorem of Robertson and Seymour in some applications. In particular, this leads to substantially improved parameters in some Erdos-Posa-type results, and faster algorithms for some fixed-parameter tractable problems.

[1]  Erik D. Demaine,et al.  Linearity of grid minors in treewidth with applications through bidimensionality , 2008, Comb..

[2]  Satish Rao,et al.  Edge Disjoint Paths in Moderately Connected Graphs , 2006, SIAM J. Comput..

[3]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[4]  Eyal Amir,et al.  Approximation Algorithms for Treewidth , 2010, Algorithmica.

[5]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.

[6]  Christian Scheideler,et al.  Improved bounds for the unsplittable flow problem , 2002, SODA '02.

[7]  Marko Samer,et al.  Fixed-Parameter Tractability , 2021, Handbook of Satisfiability.

[8]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[9]  Bruce A. Reed,et al.  Polynomial treewidth forces a large grid-like-minor , 2008, Eur. J. Comb..

[10]  Harald Räcke,et al.  Minimizing Congestion in General Networks , 2002, FOCS.

[11]  Ken-ichi Kawarabayashi,et al.  Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction , 2009, Algorithmica.

[12]  Sanjeev Khanna,et al.  Multicommodity flow, well-linked terminals, and routing problems , 2005, STOC '05.

[13]  Stephan Kreutzer,et al.  On brambles, grid-like minors, and parameterized intractability of monadic second-order logic , 2010, SODA '10.

[14]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[15]  Chandra Chekuri,et al.  Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion , 2013, SODA.

[16]  Nisheeth K. Vishnoi,et al.  On partitioning graphs via single commodity flows , 2008, STOC.

[17]  Matthew Andrews,et al.  Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke Decompositions , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[18]  Shi Li,et al.  A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[19]  Dániel Marx,et al.  The Multivariate Algorithmic Revolution and Beyond: essays dedicated to Michael R. Fellows on the occasion of His 60th birthday , 2012 .

[20]  Erik D. Demaine,et al.  Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs , 2005, JACM.

[21]  Julia Chuzhoy,et al.  Routing in undirected graphs with constant congestion , 2011, STOC '12.

[22]  Ken-ichi Kawarabayashi,et al.  Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid , 2012, STACS.

[23]  Shi Li,et al.  A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 , 2012, FOCS.

[24]  Sanjeev Khanna,et al.  The all-or-nothing multicommodity flow problem , 2004, STOC '04.

[25]  James R. Lee,et al.  Improved approximation algorithms for minimum-weight vertex separators , 2005, STOC '05.

[26]  Erik D. Demaine,et al.  Quickly deciding minor-closed parameters in general graphs , 2007, Eur. J. Comb..

[27]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[28]  D DemaineErik,et al.  Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs , 2005 .

[29]  Robin Thomas,et al.  Graph Searching and a Min-Max Theorem for Tree-Width , 1993, J. Comb. Theory, Ser. B.

[30]  L. Pósa,et al.  On Independent Circuits Contained in a Graph , 1965, Canadian Journal of Mathematics.

[31]  Satish Rao,et al.  Graph partitioning using single commodity flows , 2006, STOC '06.

[32]  Robin Thomas,et al.  Quickly Excluding a Planar Graph , 1994, J. Comb. Theory, Ser. B.

[33]  Chandra Chekuri,et al.  Multicommodity flow, well-linked terminals, and routing problems , 2005, STOC '05.

[34]  Dániel Marx,et al.  On tree width, bramble size, and expansion , 2009, J. Comb. Theory, Ser. B.

[35]  P. Lax.  Proof of a conjecture of P. Erdös on the derivative of a polynomial , 1944 .

[36]  Dimitrios M. Thilikos,et al.  Strengthening Erdös-Pósa property for minor-closed graph classes , 2011, J. Graph Theory.

[37]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[38]  Erik D. Demaine,et al.  The Bidimensionality Theory and Its Algorithmic Applications , 2008, Comput. J..

[39]  Fedor V. Fomin,et al.  The Multivariate Algorithmic Revolution and Beyond , 2012, Lecture Notes in Computer Science.

[40]  Michael R. Fellows,et al.  FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .

[41]  Carsten Thomassen,et al.  On the presence of disjoint subgraphs of a specified type , 1988, J. Graph Theory.