Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
暂无分享,去创建一个
Saket Saurabh | Mrinal Kumar | Sounaka Mishra | N. Safina Devi | Sounaka Mishra | Mrinal Kumar | Saket Saurabh | N. S. Devi
[1] László Lovász,et al. Interactive proofs and the hardness of approximating cliques , 1996, JACM.
[2] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[3] Carsten Lund,et al. Hardness of approximations , 1996 .
[4] Toshihiro Fujito,et al. A unified approximation algorithm problems ” , 1998 .
[5] Carsten Lund,et al. The Approximation of Maximum Subgraph Problems , 1993, ICALP.
[6] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .
[7] Vadim V. Lozin. On a Generalization of Bi-Complement Reducible Graphs , 2000, MFCS.
[8] Saket Saurabh,et al. Approximation Algorithms for Minimum Chain Vertex Deletion , 2011, WALCOM.
[9] John M. Lewis,et al. The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..
[10] Mihalis Yannakakis,et al. Node-Deletion Problems on Bipartite Graphs , 1981, SIAM J. Comput..
[11] Jianhua Tu,et al. The vertex cover P3P3 problem in cubic graphs , 2013, Inf. Process. Lett..
[12] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[13] Piotr Berman,et al. A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem , 1999, SIAM J. Discret. Math..