Towards tight(er) bounds for the Excluded Grid Theorem
暂无分享,去创建一个
[1] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.
[2] Erik D. Demaine,et al. The Bidimensionality Theory and Its Algorithmic Applications , 2008, Comput. J..
[3] M. Krivelevich,et al. Expanders - how to find them, and what to find in them , 2018, BCC.
[4] Paul D. Seymour,et al. Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.
[5] Ronitt Rubinfeld,et al. Short paths in expander graphs , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[6] Julia Chuzhoy,et al. Excluded Grid Theorem: Improved and Simplified , 2015, STOC.
[7] Carsten Thomassen,et al. On the presence of disjoint subgraphs of a specified type , 1988, J. Graph Theory.
[8] Dimitrios M. Thilikos,et al. Strengthening Erdös-Pósa property for minor-closed graph classes , 2011, J. Graph Theory.
[9] Satish Rao,et al. Graph partitioning using single commodity flows , 2009, JACM.
[10] W. Mader. A Reduction Method for Edge-Connectivity in Graphs , 1978 .
[11] Mohit Singh,et al. Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal , 2015, J. ACM.
[12] Ken-ichi Kawarabayashi,et al. Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid , 2012, STACS.
[13] Chandra Chekuri,et al. Degree-3 Treewidth Sparsifiers , 2014, SODA.
[14] Paul D. Seymour,et al. Tree-width and planar minors , 2015, J. Comb. Theory, Ser. B.
[15] Erik D. Demaine,et al. Quickly deciding minor-closed parameters in general graphs , 2007, Eur. J. Comb..
[16] Julia Chuzhoy,et al. Improved Bounds for the Excluded Grid Theorem , 2016, ArXiv.
[17] Robin Thomas,et al. Quickly Excluding a Planar Graph , 1994, J. Comb. Theory, Ser. B.
[18] Ken-ichi Kawarabayashi,et al. Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction , 2009, Algorithmica.
[19] Nisheeth K. Vishnoi,et al. On partitioning graphs via single commodity flows , 2008, STOC.
[20] Chandra Chekuri,et al. A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests , 2014, SIAM J. Discret. Math..
[21] Paul D. Seymour,et al. Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.