Author:
Cohen Sara,Kimelfeld Benny,Sagiv Yehoshua
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference40 articles.
1. On the complexity of the maximum subgraph problem;Lewis,1978
2. Node- and edge-deletion NP-complete problems;Yannakakis,1978
3. The node-deletion problem for hereditary properties is NP-complete;Lewis;J. Comput. System Sci.,1980
4. A new approach for approximating node deletion problems;Okun;Inform. Process. Lett.,2003
5. A unified approximation algorithm for node-deletion problems;Fujito;Discrete Appl. Math.,1998
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献