暂无分享,去创建一个
[1] Satish Rao,et al. Edge Disjoint Paths in Moderately Connected Graphs , 2006, SIAM J. Comput..
[2] Béla Bollobás,et al. Hadwiger's Conjecture is True for Almost Every Graph , 1980, Eur. J. Comb..
[3] Ronitt Rubinfeld,et al. Short paths in expander graphs , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[4] Paul D. Seymour,et al. Tree-width and planar minors , 2015, J. Comb. Theory, Ser. B.
[5] Sanjeev Khanna,et al. Multicommodity flow, well-linked terminals, and routing problems , 2005, STOC '05.
[6] Erik D. Demaine,et al. The Bidimensionality Theory and Its Algorithmic Applications , 2008, Comput. J..
[7] Julia Chuzhoy,et al. Towards Tight(er) Bounds for the Excluded Grid Theorem , 2019, SODA.
[8] Paul D. Seymour,et al. Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.
[9] Gábor Tardos,et al. A constructive proof of the general lovász local lemma , 2009, JACM.
[10] Dimitrios M. Thilikos,et al. Strengthening Erdös-Pósa property for minor-closed graph classes , 2011, J. Graph Theory.
[11] Noga Alon,et al. Spectral Techniques in Graph Algorithms , 1998, LATIN.
[12] Frank Thomson Leighton,et al. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.
[13] Chandra Chekuri,et al. Polynomial bounds for the grid-minor theorem , 2013, J. ACM.
[14] M. Krivelevich,et al. Expanders - how to find them, and what to find in them , 2018, BCC.
[15] Noga Alon,et al. Eigenvalues and expanders , 1986, Comb..
[16] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.
[17] Alan M. Frieze. Edge-disjoint paths in expander graphs , 2000, SODA '00.
[18] Erik D. Demaine,et al. Quickly deciding minor-closed parameters in general graphs , 2007, Eur. J. Comb..
[19] Alan M. Frieze,et al. Existence and Construction of Edge-Disjoint Paths on Expander Graphs , 1994, SIAM J. Comput..
[20] M. Krivelevich,et al. Complete Minors in Graphs Without Sparse Cuts , 2018, International Mathematics Research Notices.
[21] Julia Chuzhoy,et al. Improved Bounds for the Excluded Grid Theorem , 2016, ArXiv.
[22] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[23] 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.
[24] Alan M. Frieze,et al. Existence and construction of edge disjoint paths on expander graphs , 1992, STOC '92.
[25] Bruce A. Reed,et al. A Separator Theorem in Minor-Closed Classes , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[26] M. Fiedler. Algebraic connectivity of graphs , 1973 .
[27] Daniela Kühn,et al. The order of the largest complete minor in a random graph , 2007, Random Struct. Algorithms.
[28] Alessandro Panconesi,et al. Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .
[29] Robin Thomas,et al. Quickly Excluding a Planar Graph , 1994, J. Comb. Theory, Ser. B.
[30] Michael Krivelevich,et al. Finding and Using Expanders in Locally Sparse Graphs , 2017, SIAM J. Discret. Math..
[31] Julia Chuzhoy,et al. Excluded Grid Theorem: Improved and Simplified , 2015, STOC.
[32] Julia Chuzhoy,et al. Routing in undirected graphs with constant congestion , 2011, STOC '12.
[33] Ken-ichi Kawarabayashi,et al. Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid , 2012, STACS.
[34] Carsten Thomassen,et al. On the presence of disjoint subgraphs of a specified type , 1988, J. Graph Theory.