Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph

Discrete Applied Mathematics

Volumn 158, Issue 7, 2010, Pages 765-770

  Addario Berry, Louigi ^a   Kennedy, W S ^a   King, Andrew D ^a   Li, Zhentao ^a   Reed, Bruce ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Clique separable graph; Graph algorithm; i triangulated graph; Tree decomposition

Indexed keywords

BIPARTITE GRAPHS; COMPLETE MULTIPARTITE GRAPH; CUT-SET; GRAPH ALGORITHMS; GRAPH TREES; INDUCED SUBGRAPHS; K-PARTITE; NP COMPLETE; ODD CYCLE; PERFECT GRAPH; POLYNOMIAL-TIME ALGORITHMS; SUBGRAPHS;

POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

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

References (14)

1. Garey M.R., and Johnson D.S. Computers and Intractability - A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company, New York
2. 1 - ε{lunate}. Acta Mathematica 182 (1999) 105-142
3. P. Fouilhoux, Graphes k-partis et conception de circuits VLSI, Ph.D. Thesis, Université Blaise Pascal, Clermont-Ferrand, France, 2004
4. Choi H.-A., Nakajima K., and Rim C.S. Graph bipartization and via minimization. SIAM Journal on Discrete Mathematics 2 1 (1989) 38-47
5. Lancia G., Bafna V., Istrail S., Lippert R., and Schwartz R. SNPs: Problems, complexity, and algorithms. Proceedings of the 9th Annual European Symposium on Algorithms. ESA'01 (2001), Springer-Verlag, London, UK 182-193
6. Barahona F., Grötschel M., and Mahjoub A.R. Facets of the bipartite subgraph polytope. Mathematics of Operations Research 10 2 (1985) 340-358
7. Barahona F., and Mahjoub A.R. Facets of the balanced (acyclic) induced subgraph polytope. Mathematical Programming 45 1 (1989) 21-33
8. Barahona F., and Mahjoub A.R. Compositions of graphs and polyhedra i: Balanced induced subgraphs and acyclic subgraphs. SIAM Journal on Discrete Mathematics 7 3 (1994) 344-358
9. Fouilhoux P., and Mahjoub A.R. Polyhedral results for the bipartite induced subgraph problem. Discrete Applied Mathematics 154 15 (2006) 2128-2149
10. In: Ramirez-Alfonsin J., and Reed B.A. (Eds). Perfect Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization (2001), John Wiley & Sons, Inc
11. Chudnovsky M., Robertson N., Seymour P., and Thomas R. The strong perfect graph theorem. Annals of Mathematics 164 (2006) 51-229
12. Gavril F. The intersection graphs of subtrees in trees are exactly the chordal graphs. Journal of Combinatorial Theory, Series B 16 (1974) 47-56
13. Whitesides S.H. A method for solving certain graph recognition and optimization problems, with applications to perfect graphs. Annals of Discrete Mathematics 21 (1984) 281-297
14. Burlet M., and Uhry J.P. Parity graphs. Annals of Discrete Mathematics 21 (1984) 253-277