Decomposition, approximation, and coloring of odd-minor-free graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 329-344

  Demaine, Erik D ^a   Hajiaghayi, MohammadTaghi ^b   Kawarabayashi, Ken Ichi ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DOMAIN DECOMPOSITION METHODS; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

ALGORITHMIC PROBLEMS; BIPARTITE GRAPHS; BOUNDED-TREEWIDTH GRAPHS; QUADRATIC NUMBER; STRUCTURAL DECOMPOSITION; STRUCTURAL GRAPH; STRUCTURAL INSIGHTS; VERTEX COLORING;

GRAPH THEORY;

EID: 77951695090     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.28     Document Type: Conference Paper

References (69)

1. [AG06] Ittai Abraham and Cyril Gavoille. Object location using path separators. In Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing, pages 188-197, 2006.
2. [AH77] K. Appel and W. Haken. Every planar map is four colorable. I. Discharging. Illinois Journal of Mathematics, 21(3):429-490, 1977.
3. [AHK77] K. Appel, W. Haken, and J. Koch. Every planar map is four colorable. II. Reducibility. Illinois Journal of Mathematics, 21(3):491-567, 1977.
4. [Ami01] Eyal Amir. Efficient approximation for triangulation of minimum treewidth. In Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (UAI-2001), pages 7-15, San Francisco, CA, 2001. Morgan Kaufmann Publishers.
5. [APS07] Omid Amini, Stéphane Pérennes, and Ignasi Sau. Hardness and approximation of traffic grooming. In Proceedings of 18th International Symposium on Algorithms and Computation, December 2007. To appear.
6. [ARV04] Sanjeev Arora, Satish Rao, and Umesh Vazirani. Expander flows, geometric embeddings and graph partitioning. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 222-231, 2004.
7. [ASS07] Omid Amini, Ignasi Sau, and Saket Saurabh. Parameterized complexity of the smallest degree-constrained subgraph problem. Technical Report RR-6237, INRIA, June 2007. http://hal.inria.fr/inria-00157970/en/.
8. [Bak94] Brenda S. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the Association for Computing Machinery, 41(1):153-180, 1994.
9. [BBCH07] Maria-Fiorina Balcan, Avrim Blum, T.-H. Hubert Chan, and MohammadTaghi Hajiaghayi. A theory of loss-leaders: Making money by pricing below cost. In Proceedings of the 3rd International Workshop on Internet and Network Economics, 2007. To appear.
10. +98] Amotz Bar-Noy, Mihir Bellare, Magnús M. Halldórsson, Hadas Shachnai, and Tami Tamir. On chromatic sums and distributed resource allocation. Information and Computation, 140(2):183-202, February 1998.
11. [Bod05] Hans L. Bodlaender. Discovering treewidth. In Proceedings of the 31st Conference on Current Trends in Theory and Practice of Computer Science, volume 3381 of Lecture Notes in Computer Science, pages 1-16, Liptovský Ján, Slovakia, January 2005.
12. [Cat78] Paul A. Catlin. A bound on the chromatic number of a graph. Discrete Mathematics, 22(1):81-83, 1978.
13. [CGH71] Gary Chartrand, Dennis Geller, and Stephen Hedetniemi. Graphs with forbidden subgraphs. Journal of Combinatorial Theory. Series B, 10:12-41, 1971.
14. [Chl07] Eden Chlamtac. Approximation algorithms using hierarchies of semidefinite programming relaxations. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pages 691-701, 2007.
15. [CM78] W. H. Cunningham and A. B. Marsh, III. A primal algorithm for optimum matching. Mathematical Programming Study, (8):50-72, 1978.
16. [CM05] Sergio Cabello and Bojan Mohar. Finding shortest non-separating and non-contractible cycles for topologically embedded graphs. In Proceedings of the 13th Annual European Symposium on Algorithms, volume 3669 of Lecture Notes in Computer Science, pages 131-142, Palma de Mallorca, Spain, October 2005.
17. +04] Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce Reed, Paul Seymour, and Dirk Vertigan. Excluding any graph as a minor allows a low tree-width 2-coloring. Journal of Combinatorial Theory, Series B, 91(1):25-41, 2004.
18. [DFHT05] Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, and Dimitrios M. Thilikos. Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. Journal of the ACM, 52(6):866-893, 2005.
19. [DH05] Erik D. Demaine and MohammadTaghi Hajiaghayi. Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pages 682-689, Vancouver, January 2005.
20. [DHK05] Erik D. Demaine, MohammadTaghi Hajiaghayi, and Ken-ichi Kawarabayashi. Algorithmic graph minor theory: Decomposition, approximation, and coloring. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 637-646, Pittsburgh, PA, October 2005.
21. [DHM] Erik D. Demaine, MohammadTaghi Hajiaghayi, and Daniel Marx. Minimizing Movement: Fixed-parameter Tractability. Submitted to STOC 2008.
22. [DHM07] Erik D. Demaine, MohammadTaghi Hajiaghayi, and Bojan Mohar. Approximation algorithms via contraction decomposition. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 278-287, New Orleans, Louisiana, January 7-9 2007.
23. +04] Erik D. Demaine, MohammadTaghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, and Dimitrios M. Thilikos. Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. Journal of Computer and System Sciences, 69(2):166-195, September 2004.
24. [DJGT99] Reinhard Diestel, Tommy R. Jensen, Konstantin Yu. Gorbunov, and Carsten Thomassen. Highly connected sets and the excluded grid theorem. Journal of Combinatorial Theory, Series B, 75(1):61-73, 1999.
25. [DOSV00] Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, and Dirk Vertigan. Surfaces, tree-width, clique-minors, and partitions. Journal of Combinatorial Theory. Series B, 79(2):221-246, 2000.
26. [Epp00] David Eppstein. Diameter and treewidth in minor-closed graph families. Algorithmica, 27(3-4):275-291, 2000.
27. [FK98] Uriel Feige and Joe Kilian. Zero knowledge and the chromatic number. Journal of Computer and System Sciences, 57(2):187-199, 1998.
28. [Gab73] H. N. Gabow. Implementation of algorithms for maximum matching on non-bipartite graphs. PhD thesis, Department of Computer Science, Stanford University, 1973.
29. [GG02] James F. Geelen and Bertrand Guenin. Packing odd circuits in Eulerian graphs. Journal of Combinatorial Theory. Series B, 86(2):280-295, 2002.
30. +04] Jim Geelan, Bert Gerards, Luis Goddyn, Bruce Reed, Paul Seymour, and Adrian Vetta. The odd case of Hadwiger's conjecture. Submitted, 2004.
31. [GMG82] Zvi Galil, Silvio Micali, and Harold Gabow. Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pages 255-261, Chicago, IL, 1982.
32. [Gon05] Daniel Gonçalves. Edge partition of planar graphs into two outerplanar graphs. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 504-512, New York, NY, USA, 2005. ACM Press.
33. [GP82] M. Grötschel and W. R. Pulleyblank. Weakly bipartite graphs and the max-cut problem. Operations Research Letters, 1(1):23-27, 1981/1982. (Pubitemid 12561011)
34. [Gro03] Martin Grohe. Local tree-width, excluded minors, and approximation algorithms. Combinatorica, 23(4):613-632, 2003.
35. [Gue01] Bertrand Guenin. A characterization of weakly bipartite graphs. Journal of Combinatorial Theory. Series B, 83(1):112-168, 2001.
36. [Gue05] Bertrand Guenin. Talk at Oberwolfach Seminar on Graph Theory, January 2005.
37. [Had43] H. Hadwiger. Über eine Klassifikation der Streckenkomplexe. Vierteljschr. Naturforsch. Ges. Zürich, 88:133-142, 1943.
38. [HK02] Magnús M. Halldórsson and Guy Kortsarz. Tools for multicoloring with applications to planar graphs and partial k-trees. Journal of Algorithms, 42(2):334-366, 2002.
39. [HRG00] Monika R. Henzinger, Satish Rao, and Harold N. Gabow. Computing vertex connectivity: new bounds from old techniques. Journal of Algorithms, 34(2):222-250, 2000.
40. [JT95] Tommy R. Jensen and Bjarne Toft. Graph coloring problems. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Inc., New York, 1995. A Wiley-Interscience Publication.
41. [Kawa] Ken-ichi Kawarabayashi. Algorithmic aspects of the odd Hadwiger's conjecture. Submitted.
42. [Kawb] Ken-ichi Kawarabayashi. Minors in 7-chromatic graphs. Preprint.
43. [Kawc] Ken-ichi Kawarabayashi. On the connectivity of minimal and minimum counterexample to Hadwiger's conjecture. Journal of Combinatorial Theory. Series B. To appear.
44. [Kaw04] Ken-ichi Kawarabayashi. Rooted minor problems in highly connected graphs. Discrete Mathematics, 287(1-3):121-123, 2004.
45. [Ked96] Kiran S. Kedlaya. Outerplanar partitions of planar graphs. Journal of Combinatorial Theory. Series B, 67(2):238-248, 1996.
46. [Kle05] Philip N. Klein. A linear-time approximation scheme for TSP for planar weighted graphs. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science, pages 146-155, 2005.
47. [KM06] Ken-ichi Kawarabayashi and Bojan Mohar. Approximating chromatic number and list-chromatic number of minor-closed and odd-minor-closed classes of graphs. In Proceedings of the 38th ACM Symposium on Theory of Computing, pages 401-416, 2006.
48. [Kos84] A. V. Kostochka. Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica, 4(4):307-316, 1984.
49. [KS] Ken-ichi Kawarabayashi and Z. Song. Some remarks on the odd Hadwiger's conjecture. Combinatorica. To appear.
50. 4,4 as a minor. Combinatorica, 25(3):327-353, 2005.
51. [Law76] Eugene L. Lawler. Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston, New York, 1976.
52. [LR99] Tom Leighton and Satish Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787-832, 1999.
53. [LT80] Richard J. Lipton and Robert Endre Tarjan. Applications of a planar separator theorem. SIAM Journal on Computing, 9(3):615-627, 1980.
54. [NW64] C. St. J. A. Nash-Williams. Decomposition of finite graphs into forests. J. London Math. Soc., 39:12, 1964.
55. [RS86] Neil Robertson and Paul D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, 7(3):309-322, 1986.
56. [RS94] Neil Robertson and P. D. Seymour. Graph minors. XI. Circuits on a surface. Journal of Combinatorial Theory, Series B, 60(1):72-106, 1994.
57. [RS95] Neil Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory, Series B, 63(1):65-110, 1995.
58. [RS03] Neil Robertson and P. D. Seymour. Graph minors. XVI. Excluding a non-planar graph. Journal of Combinatorial Theory, Series B, 89(1):43-76, 2003.
59. [RSST97] Neil Robertson, Daniel Sanders, Paul Seymour, and Robin Thomas. The four-colour theorem. Journal of Combinatorial Theory, Series B, 70(1):2-44, 1997.
60. 6-free graphs. Combinatorica, 13(3):279-361, 1993.
61. [Sch02] Alexander Schrijver. A short proof of Guenin's characterization of weakly bipartite graphs. Journal of Combinatorial Theory. Series B, 85(2):255-260, 2002.
62. [Sey77] P. D. Seymour. The matroids with the max-flow min-cut property. Journal of Combinatorial Theory. Series B, 23(2-3):189-222, 1977.
63. [Tho95] Robin Thomas. Problem Session of the 3rd Solvene Conference on Graph Theory, Bled, Slovenia, 1995.
64. [Tho98] Mikkel Thorup. All structured programs have small tree-width and good register allocation. Information and Computation, 142(2):159-181, 1998.
65. [Tho01] Andrew Thomason. The extremal function for complete minors. Journal of Combinatorial Theory, Series B, 81(2):318-338, 2001.
66. [Tho04] Mikkel Thorup. Compact oracles for reachability and approximate distances in planar digraphs. Journal of the ACM, 51(6):993-1024, 2004.
67. [Wag37] K. Wagner. Über eine Eigenschaft der eben Komplexe. Mathematische Annalen, 114:570-590, December 1937.
68. [Yan78] Mihalis Yannakakis. Node- and edge-deletion NP-complete problems. In Conference Record of the 10th Annual ACM Symposium on Theory of Computing (San Diego, CA, 1978), pages 253-264, 1978.
69. [Zuc07] David Zuckerman. Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing, 3(6):103-128, 2007.