The complexity of finding subgraphs whose matching number equals the vertex cover number

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4835 LNCS, Issue , 2007, Pages 268-279

  Mishra, Sounaka ^a   Raman, Venkatesh ^b   Saurabh, Saket ^b   Sikdar, Somnath ^b   Subramanian, C R ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; NUMBER THEORY; PARAMETERIZATION; PROBLEM SOLVING;

MAXIMUM MATCHING; PARAMETERIZED COMPLEXITY; VERTEX COVER NUMBER;

GRAPH THEORY;

EID: 38149064415     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77120-3_25     Document Type: Conference Paper

References (18)

1. Agarwal, A., Charikar, M., Makarychev, K., Makarychev, Y.: O(√log n) Approximation Algorithms for Min UnCut, Min-2CNF Deletion, and Directed Cut Problems. In: Proc. of STOC 2005, pp. 573-581 (2005)
2. Chen, J., Kanj, I.A.: On Approximating Minimum Vertex Cover for Graphs with Perfect Matching. Theoretical Computer Science 337, 305-318 (2005)
3. Chen, J., Kanj, I.A., Xia, G.: Improved Parameterized Upper Bounds for Vertex Cover. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 238-249. Springer, Heidelberg (2006)
4. Deming, R.W.: Independence Numbers of Graphs - An Extension of the König-Egerváry Theorem. Discrete Mathematics 27, 23-33 (1979)
5. Dinur, I., Safra, S.: On the Hardness of Approximating Minimum Vertex Cover. Annals of Mathematics 162(1), 439-485 (2005)
6. Klein, P.N., Plotkin, S.A., Rao, S., Tardos, E.: Approximation Algorithms for Steiner and Directed Multicuts. Jour. of Algorithms 22(2), 241-269 (1997)
7. Korach, E., Nguyen, T., Peis, B.: Subgraph Characterization of Red/Blue-Split Graphs and König-Egervary Graphs. In: the Proc. of SODA (2006)
8. Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Company, New York (1979)
9. Guo, J., Gramm, J., Hüffher, F., Niedermeier, R., Wernicke, S.: Compression-Based Fixed-Parameter Algorithms for Feedback Vertex Set and Edge Bipartization. Jour, of Comp. and Sys. Sc. 72(8), 1386-1396 (2006)
10. 1-ε. Acta Mathematica 182, 105-142 (1999)
11. Mahajan, M., Raman, V., Sikdar, S.: Parameterizing MAX SNP Problems Above Guaranteed Values. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 38-49. Springer, Heidelberg (2006)
12. Niedermeier, R.: An Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
13. Reed, B., Smith, K., Vetta, A.: Finding Odd Cycle Transversals. Operations Research Letters 32, 299-301 (2004)
14. Schroder, H., May, A.E., Sykora, O., Vrt'o, I.: Algorithms for the Vertex Bipartization Problem. In: Jeffery, K.G. (ed.) SOFSEM 1997. LNCS, vol. 1338, pp. 547-554. Springer, Heidelberg (1997)
15. Subramanian, C.R.: Vertex Covers: Parameterizing Above the Requirement. IMSc Technical Report (February 2001)
16. Sterboul, F.: A Characterization of Graphs in which the Transversal Number Equals the Matching Number. Jour, of Comb. Theory, Series B 27, 228-229 (1979)
17. Vazirani, V.V.: A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(√VE) General Graph Maximum Matching Algorithm. Combinatorica 14(1), 71-109 (1994)
18. Zuckerman, D.: Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number. In: the Proc. of STOC 2006, pp. 681-690 (2006)