Odd cycle packing

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 695-704

  Kawarabayashi, Ken Ichi ^a   Reed, Bruce ^b,c  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b MCGILL UNIVERSITY   (Canada)

^c UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

Author keywords

odd cycle; packing

Indexed keywords

ACKERMANN FUNCTIONS; ARC-DISJOINT; DECOMPOSITION THEOREMS; DISJOINT PATHS PROBLEM; FIXED PARAMETERS; FOLLOWING PROBLEM; FREE GRAPHS; GRAPH G; GRAPH MINORS; HARDNESS RESULT; INTEGRALITY GAPS; LOWER BOUNDS; LP-RELAXATION; NODE-DISJOINT; NP-HARD; ODD CYCLE; PLANAR GRAPH; POLYNOMIAL-TIME ALGORITHMS; STRUCTURE OF GRAPH; TIME COMPLEXITY; TRACTABLE ALGORITHMS; UPPER BOUND; VERTEX DISJOINT PATHS; VERTEX-DISJOINT ODD CYCLES;

COMPUTATIONAL COMPLEXITY; DOMAIN DECOMPOSITION METHODS; GRAPH THEORY; GRAPHIC METHODS; HARDNESS; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 77954738589     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806785     Document Type: Conference Paper

References (81)

1. S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Appl. Math., 23 (1989), 11-24.
2. P. Balister, packing digraphs with directed closed trails, Combin. Probab. Comput., 12 (2003), 1-15.
3. H. L. Bodlaender, A linear-time algorithm for finding tree-decomposition of small treewidth, SIAM J. Comput., 25 (1996), 1305-1317. (Pubitemid 126584672)
4. T. Böhme, K. Kawarabayashi, J. Maharry and B. Mohar, Linear connectivity forces large complete bipartite minors, J. Combin. Theory Ser. B., 99 (2009), 557-582.
5. C. Chekuri and S. Khanna, Edge disjoint paths revisited, ACM-SIAM Symposium on Discrete Algorithms (SODA'03), 628-637, (2003).
6. M. Chudnovsky, J. Geelen, B. Gerards, L. Goddyn, M. Lohman and P. Seymour, Packing non-zero A-paths in group labelled graphs, Combinaorica, 26 (2006), 521-532.
7. I. Dejter and V. Neumann-lara, Unboundedness for generalized odd cycle traversability and a Gallai conjecture, paper presented at the Fourth Caribbean Conference on Computing, Puerto Rico, 1985.
8. E. D. Demaine, M. Hajiaghayi, and K. Kawarabayashi, Algorithmic graph minor theory: Decomposition, approximation and coloring, Proc. 46th Annual Symposium on Foundations of Computer Science (FOCS'06), 637-646, (2005).
9. R. Diestel, K. Yu. Gorbunov, T. R. Jensen, and C. Thomassen, Highly connected sets and the excluded grid theorem, J. Combin. Theory Ser. B, 75 (1999), 61-73.
10. R. Diestel, K. Kawarabayashi, T. Müller and P. Wollan, On the structure theorem of the excluded minor theorem of large tree-width, submitted.
11. P. Erdös and L. Pósa, On the maximal number of disjoint circuits of a graph, Publ. Math. Debrecen, 9 (1962), 3-12.
12. S. Fortune, J.E. Hopcroft and J. Wyllie, The directed subgraph homeomorphism problem, Theor. Comput. Sci., 10 (1980), 111-121.
13. S. Fiorini, N. Hardy, B. Reed and A. Vetta, Approximate min-max relations for odd cycles in planar graphs, Mathematical Programming, 110 (2007), 71-91.
14. A. Frank, Packing paths, cuts and circuits - a survey, in Paths, Flows and VLSI-Layout B. Korte, L. Lovász, H.J. Promel and A. Schrijver. Eds. Berlin: Springer-Verlag 1990, 49-100.
15. J. Geelen, B. Gerards, B. Reed, P. Seymour and A. Vetta, On the odd variant of Hadwiger's conjecture, J. Combin. Theory Ser. B., 99 (2009), 20-29.
16. M. X. Goemans and D.P. Williamson, Primal-dual approximation algorithms for feedback problems in planar graphs, Combinatorica, 18 (1998), 37-59. (Pubitemid 128335684)
17. V. Guruswami, S. Khanna, R. Rajaraman, B. Sherphard, and M. Yannakakis, Near-optimal hardness results and apprixmaiton algorithms for edge-disjoint paths and related problems, J. Comp. Styst. Science, 67 (2003), 473-496.
18. Also, Proc. 31st ACM Symposium on Theory of Computing, (STOC'99), 19-28, (1999).
19. F. Hadlock, Finding a maximum cut of a planar graph in polynomial time, Siam J. Comput., 4 (1975), 221-225.
20. R. Halin, S-function for graphs, J. Geometry, 8 (1976), 171-186.
21. T. Hunyh, The linkage problem for group-labelled graphs, Ph. D Thesis, University of Waterloo, 2009.
22. T. Ibaraki and H. Nagamochi, A linear time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph, Algorithmica, 7 (1992), 583-596.
23. R. Kapadia, Z. Li and B. Reed, A linear time algorithm to test the 2-paths problem, submitted.
24. K. Kawarabayashi, On the connectivity of minimal counterexamples to Hadwiger's conjecture, J. Combin. Theory Ser. B, 97 (2007), 144-150.
25. K. Kawarabayashi, Rooted minors problem in highly connected graphs, Discrete Math., 287 (2004), 121-123.
26. K. Kawarabayashi, Improved alogirthm for find a cycle through elements, IPCO'08, 374-384.
27. k-minors, J. Combin. Theory Ser. B., 99 (2009), 738-741.
28. K. Kawarabayashi and P. Wollan, Non-zero disjoint cycles in highly connected group-labelled graphs, J. Combin. Theory Ser. B, 96 (2006), 296-301.
29. K. Kawarabayashi and Z. Song, Some remarks on the odd Hadwiger's conjecture, Combinatorica, 27 (2007), 429-438.
30. K. Kawarabayashi and A. Nakamoto, The Erdocombining double acute accents-Pósa property for odd cycles on an orientable fixed surface, Discrete Math., 307 (2007), 764-768.
31. K. Kawarabayashi and B. Reed, Computing crossing number in linear time, Proc. 39th ACM Symposium on Theory of Computing (STOC'07), 382-390, (2007).
32. K. Kawarabayashi and B. Mohar, Graph and Map Isomorphism and all polyhedral embeddings in linear time, Proc. 40th ACM Symposium on Theory of Computing (STOC'08), 471-480, (2008).
33. K. Kawarabayashi and B. Reed, A nearly linear time algorithm for the half disjoint paths packing, ACM-SIAM Symposium on Discrete Algorithms (SODA'08), 446-454, (2008).
34. K. Kawarabayashi and B. Reed, A nearly linear time algorithm for the half integral parity disjoint paths packing problem (with B. Reed), ACM-SIAM Symposium on Discrete Algorithms (SODA'09), 1183-1192, (2009).
35. K. Kawarabayashi and B. Reed, Highly parity linked graphs, Combinatorica, 29 (2009), 215-225.
36. K. Kawarabayashi, B. Mohar and B. Reed, A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of bounded tree-width graphs, Proc. 49th Annual Symposium on Foundations of Computer Science (FOCS'08), 771-780, (2008).
37. K. Kawarabayashi, Y. Kobayashi and B. Reed, The disjoint paths problem in quaratic time, submitted.
38. K. Kawarabayashi and B. Reed, An (almost) linear time algorithm for odd cycles transversal, ACM-SIAM Symposium on Discrete Algorithms, (SODA'10), 365-378, (2010).
39. R. M. Karp, On the computational complexity of combinatorial problems, Network, 5 (1975), 45-68.
40. A. Kostochka, Lower bound of the Hadwiger number of graphs by their average degree, Combinatorica, 4 (1984), 307-316.
41. M. Krivelevich, Z. Nutov, M. R. Salavatipour, J. Verstaete, and R. Yuster, Approximating algorithms and hardness results for cycle packing problems, ACM transaction on Algorithms, 3 (2007), article 48.
42. Also, SODA 2005
43. and IPCO 2005.
44. B. Mohar, Combinatorial local planarity and the width of graph embeddings, Canad. J. Math., 44 (1992), 1272-1288.
45. B. Mohar and C. Thomassen, Graphs on Surfaces, Johns Hopkins University Press, Baltimore, MD, 2001.
46. L. Perkovic and B. Reed, An improved algorithm for finding tree decompositions of small width, International Journal on the Foundations of Computing Science, 11 (2000), 81-85.
47. B. Reed, Finding approximate separators and computing tree width quickly; STOC 1992, Victoria B.C., 1992.
48. B. Reed, Rooted Routing in the Plane, Discrete Applied Mathematics, 57 (1995), 213-227.
49. B. Reed, Tree width and tangles: a new connectivity measure and some applications, in "Surveys in Combinatorics, 1997 (London)", London Math. Soc. Lecture Note Ser. 241, Cambridge Univ. Press, Cambridge, 1997, pp. 87-162.
50. B. Reed, Mangoes and blueberries, Combinatorica, 19 (1999), 267-296.
51. B. Reed, Rooted Routing via Graph Minors, to appear.
52. B. Reed, N. Robertson, A. Schrijver and P. D. Seymour, Finding disjoint trees in planar graphs in linear time. Graph structure theory (Seattle, WA, 1991), 295-301,
53. Contemp. Math., 147, Amer. Math. Soc., Providenc, RI, 1993.
54. B. Reed, K. Smith and A. Vetta, Finding odd cycle transversals, Operation Research Letter, 32 (2004), 299-301.
55. B. Reed and D. Wood, A linear time algorithm to find a separator in a graph with an excluded minor, submitted.
56. R. Rizzi, V. Bafna, S. Istrail, G. Lancia, Practical algorithms and fixed parameter tractability for the single individual SNP haplotyping problem, Algorithms in Bioinformatics: Second international workshop, Lecture notes in computer scienece, 2452, Springer, Berlin, 2002, 29-43.
57. N. Robertson and P. D. Seymour, Graph minors. III. Planar tree-width, J. Combin. Theory Ser. B, 36 (1984), 49-63.
58. N. Robertson and P. D. Seymour, Graph minors. V. Excluding a planar graph, J. Combin. Theory Ser. B, 41 (1986), 92-114.
59. N. Robertson and P. D. Seymour, Graph minors. VII. Disjoint paths on a surface, J. Combin. Theory Ser. B, 45 (1988), 212-254.
60. N. Robertson and P. D. Seymour, Graph minors. IX. Disjoint crossed paths, J. Combin. Theory Ser. B, 49 (1990), 40-77.
61. N. Robertson and P. D. Seymour, Graph minors. X. Obstructions to tree-decomposition, J. Combin. Theory Ser. B, 52 (1991), 153-190.
62. N. Robertson and P. D. Seymour, Graph minors. XI. Circuits on a surface, J. Combin. Theory Ser. B, 60 (1994), 72-106.
63. N. Robertson and P. D. Seymour, Graph minors. XII. Distance on a surface, J. Combin. Theory, Ser. B, 64 (1995), 240-272.
64. N. Robertson and P. D. Seymour, Graph minors. XIII. The disjoint paths problem, J. Combin. Theory Ser. B, 63 (1995), 65-110.
65. N. Robertson and P. D. Seymour, Graph minors. XVI. Excluding a non-planar graph, J. Combin. Theory Ser. B, 89 (2003), 43-76.
66. N. Robertson and P. D. Seymour, Graph minors. XVII. Taming a vortex, J. Combin. Theory Ser. B, 77 (1999), 162-210.
67. N. Robertson and P. D. Seymour, Graph Minors XXI. Graphs with uniquely linkages, to appear in J. Combin. Theory Ser. B.
68. N. Robertson and P. D. Seymour, Graph Minors XXII. Irrelevant vertices in linkage problems, to appear in J. Combin. Theory Ser. B.
69. N. Robertson and P. D. Seymour, An outline of a disjoint paths algorithm, in: "Paths, Flows, and VLSI-Layout," B. Korte, L. Lovász, H. J. Prömel, and A. Schrijver (Eds.), Springer-Verlag, Berlin, 1990, pp. 267-292.
70. N. Robertson, P. D. Seymour and R. Thomas, Quickly excluding a planar graph, J. Combin. Theory Ser. B, 62 (1994), 323-348.
71. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, number 24 in Algorithm and Combinatorics, Springer Verlag, 2003.
72. P.D. Seymour, Decomposition of regular matroids. J. Combin. Theory, Ser. B, 28 (1980), 305-359.
73. P. Seymour, Disjoint paths in graphs, Discrete Mathematics, 29 (1980), 293-309.
74. P. Seymour, Matroid minors, Handbook of Combinatorics, (Eds.: R. L. Graham, M. Grötschel and L. Lóvasz). North-Holland, Amsterdam, 1985, 419-431.
75. P. Seymour and R. Thomas, Graph searching and a min-max theorem for tree-width, J. Combin. Theory Ser. B, 58 (1993), 22-33.
76. R.E. Tarjan, Data Structures and network algorithms, SIAM, Philadelphia, PA, 1983.
77. T. Tholey, Solving the 2-disjoint paths problem in nearly linear time, Theory of computing systems, 39 (2004), 51-78.
78. A. Thomason, An extremal function for contractions of graphs, Math. Proc. Cambridge Philos. Soc., 95 (1984), 261-265.
79. C. Thomassen, 2-linked graph, European J. Combinatorics, 1 (1980), 371-378.
80. C. Thomassen, On the presence of disjoint subgraphs of a specified type, J. Graph Theory, 12 (1988), 101-111.
81. K. Wagner, Über eine Eigenschaft der ebenen Komplexe, Math. Ann., 114 (1937), 570-590.