Author:
Mishra Sounaka,Rajakrishnan Shijin,Saurabh Saket
Subject
General Computer Science,Theoretical Computer Science
Reference26 articles.
1. O(logn) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems;Agarwal,2005
2. König–Egerváry graphs, 2-bicritical graphs and fractional matchings;Bourjolly;Discrete Appl. Math.,1989
3. Minimum 2sat-deletion: inapproximability results and relations to minimum vertex cover;Chlebík;Discrete Appl. Math.,2007
4. Parameterized Algorithms;Cygan,2015
5. Independence numbers of graphs – an extension of the König–Egerváry theorem;Deming;Discrete Math.,1979