An (almost) linear time algorithm for odd cycles transversal

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 365-378

  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

Erdocombining double acute accents P sa property; Half integral disjoint odd cycles packing; Nearly linear time algorithm

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATIONAL COMPLEXITY; INVERSE PROBLEMS;

ACKERMANN FUNCTIONS; EDGE VERSION; FOLLOWING PROBLEM; LINEAR-TIME ALGORITHMS; ODD CYCLE; PACKING PROBLEMS; TIME ALGORITHMS; TIME COMPLEXITY;

GRAPH THEORY;

EID: 77951699175     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.31     Document Type: Conference Paper

References (42)

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. 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
3. H. L. Bodlaender, A linear-time algorithm for finding tree-decomposition of small treewidth, SIAM J. Comput. 25 (1996), 1305-1317.
4. 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.
5. 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.
6. E. D. Demaine, M. Hajiaghayi, and K. Kawarabayashi, Algorithmic graph minor theory: Decomposition, approximation and coloring, Proc. 46th Ann. IEEE Symp. Found. Comp. Sci. (FOCS'05) Pittsburgh., 637-646.
7. 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.
8. P. Erdös and L. Pósa, On the maximal number of disjoint circuits of a graph, Publ. Math. Debrecen 9 (1962), 3-12.
9. S. Fiorini, N. Hardy, B. Reed and A. Vetta, Planar graph bipartization in linear time, Discrete Applied Mathematics 156 (2008), 1175-1180. (Pubitemid 351329421)
10. 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.
11. J. Guo, J. Granm, F. Hüffner, R. Niedermeier and S. Wernicke, Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization, J. Comput. System Science 72 (2006), 1386-1396.
12. R. Halin, S-function for graphs, J. Geometry 8 (1976), 171-186.
13. F. Hadlock, Finding a maximum cut of a planar graph in polynomial time, Siam J. Comput. 4 (1975), 221-225.
14. T. Ibaraki and H. Nagamichi, A linear time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph, Algorithmica 7 ( 1992), 583-596.
15. 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.
16. K. Kawarabayashi and B. Reed, A nearly linear time algorithm for the half integral disjoint paths packing, ACM-SIAM Symposium on Discrete Algorithms (SODA'08), 446-454.
17. K. Kawarabayashi and B. Reed, Highly parity linked graphs, Combinatorica 29 (2009), 215-225.
18. K. Kawarabayashi and Z. Song, Some remarks on the odd Hadwiger's conjecture, Combinatorica 27 (2007), 429-438.
19. K. Kawarabayashi, Y. Kobayashi and B. Reed, The disjoint paths problem in quaratic time, submitted.
20. J. Kleinberg, Decision algorithms for unsplittable flows and the half-disjoint paths problem, Proc. 30th ACM Symposium on Theory of Computing (STOC'98) 530-539.
21. A. Kostochka, Lower bound of the Hadwiger number of graphs by their average degree, Combinatorica 4 (1984), 307-316.
22. A. Kostochka, The minimum Hadwiger number for graphs with a given mean degree of vertices (in Russian), Metody Diskret. Analiz. 38 (1982), 37-58.
23. M. Middendorf and F. Pfeiffer, On the complexity of the disjoint paths problem, Combinatorica 13 (1993), 97-107.
24. B. Mohar and C. Thomassen, Graphs on Surfaces, Johns Hopkins University Press, Baltimore, MD, 2001.
25. R. Niedermeier, Invitation to Fixed-Parameter Algorithms, Oxford University Press, 2006.
26. B. Reed, Finding approximate separators and computing tree width quickly, Proc. 24th ACM Symposium on Theory of Computing (STOC'92).
27. 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, 87-162.
28. B. Reed, Mangoes and blueberries, Combinatorica 19 (1999), 267-296.
29. B. Reed, K. Smith and A. Vetta, Finding odd cycle transversals, Operation Research Utter 32 (2004), 299-301.
30. 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.
31. N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, J. Algorithm 7 (1986), 309-322.
32. N. Robertson and P. D. Seymour, Graph minors. V. Excluding a planar graph, J. Combin. Theory Ser. B 41 (1986), 92-114.
33. N. Robertson and P. D. Seymour, Graph minors. XIII. The disjoint paths problem, J. Combin. Theory Ser. B 63 (1995), 65-110.
34. N. Robertson, P. D. Seymour and R. Thomas, Quickly excluding a planar graph, J. Combin. Theory Ser. B 62 (1994), 323-348.
35. P. Seymour, Disjoint paths in graphs, Discrete Math. 29 (1980), 293-309.
36. P. Seymour, Matroid minors, Handbook of Combinatorics, (Eds.: R. L. Graham, M. Grötschel and L. Lóvasz). North-Holland Amsterdam 1985, 419-431.
37. P. Seymour and R. Thomas, Graph searching and a min-max theorem for tree-width, J. Combin. Theory Ser. B 58 (1993), 22-33.
38. R.E. Tarjan, Data Structures and network algorithms, SIAM, Philadelphia PA, 1983.
39. A. Thomason, An extremal function for contractions of graphs, Math. Proc. Cambridge Philos. Soc 95 (1984), 261-265.
40. A. Thomason, The extremal function for complete minors, J. Combin. Theory Ser. B 81 (2001), 318-338.
41. C. Thomassen, 2-linked graph, European Journal of Combinatorics 1 (1980), 371-378.
42. C. Thomassen, On the presence of disjoint subgraphs of a specified type, Journal of Graph Theory 12(1988), 101-111.