Paths, flowers and vertex cover

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

Volumn 6942 LNCS, Issue , 2011, Pages 382-393

  Raman, Venkatesh ^a   Ramanujan, M S ^a   Saurabh, Saket ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

AUGMENTING PATH; EDMONDS' MATCHING ALGORITHM; GENERAL GRAPH; MAXIMUM MATCHINGS; MINIMUM VERTEX COVER; RUNNING TIME; RUNTIMES; VERTEX COVER; VERTEX COVER PROBLEMS;

ALGORITHMS;

GRAPH THEORY;

EID: 80052818449     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23719-5_33     Document Type: Conference Paper

References (16)

1. Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40-42), 3736-3756 (2010)
2. Chen, J., Liu, Y., Lu, S.: An improved parameterized algorithm for the minimum node multiway cut problem. Algorithmica 55(1), 1-13 (2009)
3. Chen, J., Liu, Y., Lu, S., O'Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55(5) (2008)
4. Demaine, E., Gutin, G., Marx, D., Stege, U.: Open problems from dagstuhl seminar 07281 (2007)
5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
6. Edmonds, J.: Paths, trees, and flowers. Canad. J. Math. 17, 449-467 (1965)
7. Flum, J., Grohe, M.: Parameterized Complexity Theory. In: Texts in Theoretical Computer Science. Springer, Berlin (2006)
8. Khot, S., Raman, V.: Parameterized complexity of finding subgraphs with hereditary properties. Theor. Comput. Sci. 289(2), 997-1008 (2002)
9. Lovász, L., Plummer, M.D.: Matching Theory. North-Holland, Amsterdam (1986)
10. Mahajan, M., Raman, V.: Parameterizing above guaranteed values: Maxsat and maxcut. J. Algorithms 31(2), 335-354 (1999)
11. Marx, D.: Parameterized graph separation problems. Theoret. Comput. Sci. 351(3), 394-406 (2006)
12. Marx, D., Razgon, I.: Constant ratio fixed-parameter approximation of the edge multicut problem. Inf. Process. Lett. 109(20), 1161-1166 (2009)
13. Marx, D., Razgon, I.: Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: STOC, pp. 469-478 (2011)
14. Mishra, S., Raman, V., Saurabh, S., Sikdar, S., Subramanian, C.R.: The complexity of könig subgraph problems and above-guarantee vertex cover. Algorithmica 58 (2010)
15. Razgon, I., O'Sullivan, B.: Almost 2-sat is fixed-parameter tractable. J. Comput. Syst. Sci. 75(8), 435-450 (2009)
16. Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32(4), 299-301 (2004)