Algorithmic graph minor theory: Decomposition, approximation, and coloring
暂无分享,去创建一个
Ken-ichi Kawarabayashi | Erik D. Demaine | Mohammad Taghi Hajiaghayi | E. Demaine | M. Hajiaghayi | K. Kawarabayashi
[1] Mihalis Yannakakis,et al. Node-and edge-deletion NP-complete problems , 1978, STOC.
[2] Paul D. Seymour,et al. Graph Minors. XX. Wagner's conjecture , 2004, J. Comb. Theory B.
[3] Robin Thomas,et al. Call routing and the ratcatcher , 1994, Comb..
[5] Siam J. CoMPtrr,et al. FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME * , 2022 .
[6] Erik D. Demaine,et al. Diameter and Treewidth in Minor-Closed Graph Families, Revisited , 2004, Algorithmica.
[7] Zhi-Zhong Chen. Efficient Approximation Schemes for Maximization Problems on K3,3-free or K5-free Graphs , 1998, J. Algorithms.
[8] Robin Thomas,et al. Hadwiger's conjecture forK6-free graphs , 1993, Comb..
[9] Uriel Feige,et al. The Dense k -Subgraph Problem , 2001, Algorithmica.
[10] A. Sahai,et al. Dimension Reduction in the l 1 norm , 2002 .
[11] Erik D. Demaine,et al. Bidimensionality: new connections between FPT algorithms and PTASs , 2005, SODA '05.
[12] Erik D. Demaine,et al. Approximation algorithms for classes of graphs excluding single-crossing graphs as minors , 2004, J. Comput. Syst. Sci..
[13] Erik D. Demaine,et al. Bidimensional Parameters and Local Treewidth , 2004, SIAM J. Discret. Math..
[14] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[15] David R. Karger,et al. An Õ(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs , 1997, Information Processing Letters.
[16] James R. Lee,et al. Improved approximation algorithms for minimum-weight vertex separators , 2005, STOC '05.
[17] K. Wagner. Über eine Eigenschaft der ebenen Komplexe , 1937 .
[18] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.
[19] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.
[20] Bojan Mohar,et al. Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs , 2007, Discret. Comput. Geom..
[21] Michael R. Fellows,et al. Nonconstructive tools for proving polynomial-time decidability , 1988, JACM.
[22] Paul Seymour,et al. The metamathematics of the graph minor theorem , 1985 .
[23] K. Appel,et al. Every planar map is four colorable. Part I: Discharging , 1977 .
[24] Erik D. Demaine,et al. Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs , 2004, SODA '04.
[25] Paul D. Seymour,et al. Graph Minors. XI. Circuits on a Surface , 1994, J. Comb. Theory, Ser. B.
[26] Erik D. Demaine,et al. Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors , 2005, Algorithmica.
[27] Martin Grohe. Local Tree-Width, Excluded Minors, and Approximation Algorithms , 2003, Comb..
[28] Satish Rao,et al. Shallow excluded minors and improved graph decompositions , 1994, SODA '94.
[29] Guy Kortsarz,et al. Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees , 2002, J. Algorithms.
[30] Robin Thomas,et al. Excluding a Countable Clique , 1999, J. Comb. Theory, Ser. B.
[31] Paul D. Seymour,et al. Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.
[32] David Eppstein. Diameter and Treewidth in Minor-Closed Graph Families , 2000, Algorithmica.
[33] Paul D. Seymour,et al. Graph Minors. XVI. Excluding a non-planar graph , 2003, J. Comb. Theory, Ser. B.
[34] Uriel Feige,et al. Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..
[35] Erik D. Demaine,et al. Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs , 2005, JACM.
[36] Paul D. Seymour,et al. Graph minors. VII. Disjoint paths on a surface , 1988, J. Comb. Theory, Ser. B.
[37] Erik D. Demaine,et al. Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs , 2005, TALG.
[38] Erik D. Demaine,et al. Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality , 2005, SODA '05.
[39] Philip N. Klein,et al. Excluded minors, network decomposition, and multicommodity flow , 1993, STOC.
[40] Sanjeev Khanna,et al. Edge-disjoint paths in planar graphs , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[41] K. Appel,et al. Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.
[42] Anupam Gupta,et al. Embedding k-outerplanar graphs into ℓ1 , 2003, SODA '03.
[43] Erik D. Demaine,et al. The Bidimensional Theory of Bounded-Genus Graphs , 2004, SIAM J. Discret. Math..
[44] Alexandr V. Kostochka,et al. Lower bound of the hadwiger number of graphs by their average degree , 1984, Comb..
[45] Andrew Thomason,et al. The Extremal Function for Complete Minors , 2001, J. Comb. Theory B.
[46] Anupam Gupta,et al. Cuts, Trees and ℓ1-Embeddings of Graphs* , 2004, Comb..
[47] Paul D. Seymour,et al. Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.
[48] Robin Thomas,et al. Quickly Excluding a Planar Graph , 1994, J. Comb. Theory, Ser. B.
[49] Robin Thomas,et al. The Four-Colour Theorem , 1997, J. Comb. Theory, Ser. B.
[50] Erik D. Demaine,et al. Equivalence of local treewidth and linear local treewidth and its algorithmic applications , 2004, SODA '04.
[51] Mihir Bellare,et al. On Chromatic Sums and Distributed Resource Allocation , 1998, Inf. Comput..
[52] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.
[53] Bruce A. Reed,et al. Excluding any graph as a minor allows a low tree-width 2-coloring , 2004, J. Comb. Theory, Ser. B.
[54] K. Appel,et al. Every planar map is four colorable. Part II: Reducibility , 1977 .
[55] Amit Sahai,et al. Dimension reduction in the /spl lscr//sub 1/ norm , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[56] B. A. Reed,et al. Algorithmic Aspects of Tree Width , 2003 .