Planar graph bipartization in linear time

Discrete Applied Mathematics

Volumn 156, Issue 7, 2008, Pages 1175-1180

  Fiorini, Samuel ^a,b   Hardy, Nadia ^c   Reed, Bruce ^c   Vetta, Adrian ^c  

^a HEC MONTRÉAL   (Canada)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

Linear time algorithm; Odd cycle; Planar graph

Indexed keywords

LINEAR EQUATIONS; PLANAR WAVEGUIDES; PROBLEM SOLVING; TIME DOMAIN ANALYSIS;

LINEAR TIME ALGORITHMS; ODD CYCLES; PLANAR GRAPHS;

GRAPH THEORY;

EID: 40149111704     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.08.013     Document Type: Article

References (15)

1. Alon N., Seymour P., and Thomas R. Planar separators. SIAM J. Discrete Math. 7 2 (1994) 184-193
2. Arnborg S., Lagergren J., and Seese D. Easy problems for tree-decomposable graphs. J. Algorithms 12 (1991) 308-340
3. Bodlaender H. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25 (1996) 1305-1317
4. Courcelle B. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inform. and Comput. 85 (1996) 1305-1317
5. Goemans M., and Williamson D. Primal-dual approximation algorithms for feedback problems in planar graphs. Combinatorica 18 (1998) 37-59
6. Hadlock F. Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4 3 (1975) 221-225
7. Hopcroft J., and Tarjan R. Efficient planarity testing. J. Assoc. Comput. Mach. 21 (1974) 549-568
8. Kleinberg J., and Kumar A. Wavelength conversion in optical networks. Proceedings of the Tenth Conference Annual ACM-SIAM Symposium on Discrete Algorithms. Baltimore, MD, 1999 (1999) 566-575
9. Král D., and Voss H. Edge-disjoint odd cycles in planar graphs. J. Combin. Theory Ser. B 90 1 (2004) 107-120
10. Lucchesi C., and Younger D. A minimax theorem for directed graphs. J. London Math. Soc. 17 (1978) 369-374
11. Reed B. Mangoes and blueberries. Combinatorica 19 (1999) 267-296
12. Reed B., Smith K., and Vetta A. Finding odd cycle transversals. Oper. Res. Lett. 32 (2004) 299-301
13. Rizzi R., Bafna V., Istrail S., and Lancia G. Practical algorithms and fixed parameter tractability for the single individual SNP haplotyping problem. Algorithms in Bioinformatics, Lecture Notes in Computer Science vol. 2452 (2002), Springer, Berlin 29-43
14. Robertson N., and Seymour P. Graph minors V. Excluding a planar graph. J. Combin. Theory Ser. B 36 (1986) 92-114
15. Robertson N., Seymour P., and Thomas R. Quickly excluding a planar graph. J. Combin. Theory Ser. B 62 (1994) 323-348