König deletion sets and vertex covers above the matching size

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

Volumn 5369 LNCS, Issue , 2008, Pages 836-847

  Mishra, Sounaka ^a   Raman, Venkatesh ^b   Saurabh, Saket ^c   Sikdar, Somnath ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^c UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

MAXIMUM MATCHING; SPLIT GRAPHS; VERTEX COVER;

PARAMETER ESTIMATION;

EID: 58549086600     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92182-0_73     Document Type: Conference Paper

References (18)

1. Bourjolly, J.M., Pulleyblank, W.R.: König-Egerváry Graphs, 2-Bicritical Graphs and Fractional Matchings. Disc. Appl. Math. 24, 63-82 (1989)
2. Cai, L.: Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties. Inform. Proc. Lett. 58(4), 171-176 (1996)
3. Deming, R.W.: Independence Numbers of Graphs - An Extension of the König-Egerváry Theorem. Disc. Math. 27, 23-33 (1979)
4. Faigle, U., Fuchs, B., Wienand, B.: Covering Graphs by Colored Stable Sets. Electronic Notes in Disc. Math. 17, 145-149 (2004)
5. Földes, S., Hammer, PL.: Split graphs. In: Proc. of the 8th Southeastern Conference on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La, pp. 311-315, Congressus Numerantium, Winnipeg, vol. XIX, Utilitas Math. (1977)
6. 0.288 n) Independent Set Algorithm. In: Proc. of SODA 2006, pp. 18-25 (2006)
7. Gavril, F.: An Efficiently Solvable Graph Partition Problem to Which Many Problems are Reducible. Inform. Proc. Lett. 45, 285-290 (1993)
8. Gavril, F., Yannakakis, M.: Edge Dominating Sets in Graphs. SIAM Jour. Appl. Math. 38(3), 364-372 (1980)
9. Korach, E., Nguyen, T., Peis, B.: Subgraph Characterization of Red/Blue-Split Graphs and König-Egerváry Graphs. In: Proc. of SODA 2006, pp. 842-850 (2006)
10. Lovász, L.: Ear-Decompositions of Matching-covered Graphs. Combinatorica 3, 105-118 (1983)
11. Lovász, L., Plummer, M.D.: Matching Theory. North Holland, Amsterdam (1986)
12. Mishra, S., Raman, V., Saurabh, S., Sikdar, S., Subramanian, C.R.: The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 268-279. Springer, Heidelberg (2007)
13. Moser, H., Thilikos, D.M.: Parameterized Complexity of Finding Regular Induced Subgraphs. In: Proc. of ACiD 2006, pp. 107-118 (2006)
14. Niedermeier, R.: An Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
15. Raman, V., Saurabh, S., Sikdar, S.: Efficient Exact Algorithms Through Enumerating Maximal Independent Sets and Other Techniques. Theory Comput. Systems 41, 563-587 (2007)
16. Razgon, I., O'Sullivan, B.: Almost 2-SAT is Fixed-Parameter Tractable. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 551-562. Springer, Heidelberg (2008)
17. Reed, B., Smith, K., Vetta, A.: Finding Odd Cycle Transversals. Operations Research Letters 32, 299-301 (2004)
18. Sterboul, F.: A Characterization of Graphs in which the Transversal Number Equals the Matching Number. Jour. of Comb. Theory, Ser. B 27, 228-229 (1979)