## Computational complexity of minimum P4 vertex cover problem for regular and K1, 4-free graphs

- N. Safina Devi, Aniket C. Mane, Sounaka Mishra
- Discrete Applied Mathematics
- 2015

Highly Influenced

@article{Fujito1998AUA, title={A Unified Approximation Algorithm for Node-deletion Problems}, author={Toshihiro Fujito}, journal={Discrete Applied Mathematics}, year={1998}, volume={86}, pages={213-231} }

- Published 1998 in Discrete Applied Mathematics
DOI:10.1016/S0166-218X(98)00035-3

In this paper we consider a unified (polynomial time) approximation method for node-deletion problems with nontrivial and hereditary graph properties. One generic algorithm scheme is presented, which can be applied to any node-deletion problem for finding approximate solutions. It will be shown then that the quality of solutions found by this algorithm is determined by the quality of any minimal solution in any graph in which nodes are weighted according to a certain scheme chosen by the… CONTINUE READING

29 Citations

16 References

Similar Papers